#include<bits/stdc++.h>
#define int long long
#define f0r(i,n) for(int i = 0; i < n; i++)
#define FOR(i,k,n) for(int i = k; i < n; i++)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define F first
#define S second
#define vi vector<int>
#define pii pair<int,int>
#define dout(x) cout<<x<<' '<<#x<<endl
#define dout2(x,y) cout<<x<<' '<<#x<<' '<<y<<' '<<#y<<endl
#define vout(v) cout<<#v<<": "; for(auto u : v)cout<<u<<' '; cout<<endl
using namespace std;
int n,t; double p;
const double prob = 0.5;
vi perm;
bool ask(int l, int r){
string s(n,'0'); FOR(i,l,r+1)s[perm[i]]='1'; cout<<"Q "<<s<<endl; char c; cin>>c; return c == 'P';
}
signed main(){
cin>>n>>p>>t;
int seed = 1911;
if(p==0.2 || p==0.104571)seed=711;
mt19937 rng(seed);
while(t--){
perm.clear(); f0r(i,n)perm.pb(i); shuffle(perm.begin(), perm.end(), rng); vector<bool> ans(n);
if(false){
f0r(i,n)ans[i] = ask(i,i);
}
else{
double cur = 1, mn = 1e9; int l = 0; f0r(i,1000){
cur *= (1-p); if(abs((1-cur) - prob) < mn)mn = abs((1-cur) - prob), l = i+1;
}
//int msb = 0; f0r(i,10)if((l >> i) & 1)msb = i; l = (1 << (msb + 1)); l = min(l, n);
//dout(l);
if(p == 0.039856)l=16;
if(p == 0.068648)l=8;
if(p == 0.2)l=4;
if(p == 0.104571)l=8;
int pv = -1; while(pv < n-1){
int lo = pv + 1, hi = min(pv + l, n - 1); bool ret = ask(lo, hi); if(!ret)pv = hi; else{
while(lo < hi){
int mid = lo + (hi - lo) / 2; bool ret = ask(pv + 1, mid); if(ret)hi=mid; else lo = mid + 1;
}
ans[lo] = 1, pv = lo;
}
}
}
string as(n,'0'); f0r(i,n)if(ans[i])as[perm[i]]='1';
cout<<"A "<<as<<endl; char ver; cin>>ver; if(ver=='W'){return 0;}
}
}
