#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1005;
int n,t,rs[N],g[N][N];
double k,f[N][N],pw[N];
int gets(int l,int r){
	cout<<"Q ";
	for(int i=1;i<l;i++)putchar('0');
	for(int i=l;i<=r;i++)putchar('1');
	for(int i=r+1;i<=n;i++)putchar('0');
	cout<<endl;
	char x;
	cin>>x;
	return x=='P';
}
void solve(int l,int r,int a,int b){
//	cout<<l<<" "<<r<<" "<<a<<" "<<b<<endl;
	if(a==b){
	    rs[a]=1;
		a=b+1;
		l++;
		if(l>r)return;
	}
	if(a>b){
		int k=g[r-l+1][0];
		if(gets(a,a+k-1)){
			solve(l,r,a,a+k-1);
		}else{
			solve(a+k,r,a+k,a+k-1);
		}
	}else{
		int k=g[r-l+1][b-a+1];
		if(gets(a,a+k-1)){
			solve(l,r,a,a+k-1);
		}else{
			solve(a+k,r,a+k,b);
		}
	}
}
void find_positive(){
	memset(rs,0,sizeof(rs));
	solve(1,n,1,0);
	cout<<"A ";
	for(int i=1;i<=n;i++)putchar(rs[i]+'0');
    cout<<endl;
    char c;
    cin>>c;
}
signed main(){
	cin>>n>>k>>t;
	for(int i=1;i<=n;i++)pw[i]=pw[i-1]*(1-k);
	for(int i=1;i<=n;i++){
		for(int j=i;j>=0;j--){
			f[i][j]=1e9;
			if(j==0){
				for(int k=1;k<=i;k++){
					double ans=f[i-k][j]*pw[k]+f[i][k]*(1-pw[k])+1;
					if(ans<f[i][j]){
						g[i][j]=k;
						f[i][j]=ans;
					}
				}
			}else if(j==1)f[i][j]=f[i-1][0],g[i][j]=0;
			else for(int k=1;k<j;k++){
				double ks=(pw[k]-pw[j])/(1-pw[j]);
				double ans=f[i-k][j-k]*ks+f[i][k]*(1-ks)+1;
				if(ans<f[i][j]){
					g[i][j]=k;
					f[i][j]=ans;
				}
			}
		}
	}
	while(t--)find_positive();
}