#include <bits/stdc++.h>
using namespace std;

/// You may use:

// The number of students
int N;

// The probability any given student is positive
double P;

// This function performs a test on a subset of samples.
// Its argument is a vector of Booleans of length N,
// where the i-th element is true if the i-th sample should be added to the mix.
// It returns true if (and only if) at least one of the samples in the mix is positive.
bool test_students(vector<bool> mask) {
    assert(mask.size() == (size_t)N);

    string mask_str(N, ' ');
    for (int i = 0; i < N; i++)
        mask_str[i] = mask[i] ? '1' : '0';

    printf("Q %s\n", mask_str.c_str());
    fflush(stdout);

    char answer;
    scanf(" %c", &answer);
    return answer == 'P';
}

bool test_range(int l, int r) {
	vector<bool> mask(N, 0);
	for (int i = l; i <= r; i++) {
		mask[i] = 1;
	}
	return test_students(mask);
} 

int lgt;

/// You should implement:

// This function will be called once for each test instance.
// It should use test_students to determine which samples are positive.
// It must return a vector of Booleans of length N,
// where the i-th element is true if and only if the i-th sample is positive.
std::vector<bool> find_positive() {
    std::vector<bool> answer(N);
    int idx = 0;
    while (idx < N) {
    	if (!test_range(idx, min(idx + lgt - 1, N - 1))) {
    		idx += lgt;
    		continue;
		}
		int l = idx, r = min(idx + lgt - 2, N - 1);
		int pos = r + 1;
		while (l <= r) {
			int mid = (l + r) >> 1;
			if (test_range(l, mid)) {
				pos = mid;
				r = mid - 1;
			} else {
				l = mid + 1;
			}
		}
		answer[pos] = 1;
		idx = pos + 1;
	}
    return answer;
}

int main() {
    int T;
    scanf("%d %lf %d", &N, &P, &T);

    // You may perform any extra initialization here.
    if (T == 1) {
    	lgt = 1;
	} else if (P >= 0.2) {
		lgt = 3;
	} else if (P >= 0.15) {
		lgt = 4;
	} else if (P >= 0.10) {
		lgt = 7;
	} else {
		lgt = 0.65 / P;
	}

    for (int i = 0; i < T; i++) {
        std::vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);

        std::string answer_str(N, ' ');
        for (int j = 0; j < N; j++)
            answer_str[j] = answer[j] ? '1' : '0';

        printf("A %s\n", answer_str.c_str());
        fflush(stdout);

        char verdict;
        scanf(" %c", &verdict);
        if (verdict == 'W')
            exit(0);
    }

    return 0;
}