#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a), end(a)
using ll = long long;
using vi = vector<int>;
using ar2 = array<int,2>;
using ar3 = array<int,3>;
using ar4 = array<int,4>;
const int INF = (int)2e9;
const int mxN = (int)1e6+10;
const double prob[] = {0.001, 0.005256, 0.011546, 0.028545, 0.039856, 0.068648, 0.104571, 0.158765, 0.2};
const int bs[] = {1000, 190, 86, 23, 17, 9, 7, 5, 3};
int N;
double P;

bool test_students(std::vector<bool> mask) {
    assert(mask.size() == (size_t)N);
    std::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');
}
 
vector<bool> find_positive() {
    vector<bool> answer(N,0), test(N,0);
    if(!P) return answer;
    if(P>=0.3){
		for(int i = 0; i < N; i++){
			test[i]=1;
			if(test_students(test))
				answer[i]=1;
			test[i]=0;
		}
		return answer;
	} 
	int B = 1;
	for(int i = 0; i < 9; i++)
		if (P == prob[i]) B = bs[i];
    for(int i = 0; i < N; i+=B){
		int l = i, rr = min(N,i+B)-1;
		while(l<=rr){
			int r = rr+1;
			while(l<r){
				int mid = (l+r)/2;
				fill(begin(test)+l,begin(test)+mid+1,1);
				int chk = test_students(test);
				fill(begin(test)+l,begin(test)+mid+1,0);
				if(chk) r=mid;
				else l=mid+1;
			}
			if(l==rr+1) break;
			answer[l]=1; l++;
		}
		fill(begin(test)+i,begin(test)+rr+1,0);
	}
    return answer;
}
 
int main() {
    int T;
    scanf("%d %lf %d", &N, &P, &T);

    for (int i = 0; i < T; i++) {
        vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);
 
        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;
}