#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1005;
int n,t,rs[N];
double k;
int gets(int l,int r){
	cout<<"Q ";
	for(int i=1;i<l;i++)cout<<0;
	for(int i=l;i<=r;i++)cout<<1;
	for(int i=r+1;i<=n;i++)cout<<0;
	cout<<endl;
	int x;
	cin>>x;
	return x;
}
void solve(int l,int r){
	if(l==r){
		rs[l]=1;
		return;
	}
	int mid=l+r>>1;
	if(gets(l,mid)){
		if(gets(mid+1,r))solve(mid+1,r);
		solve(l,mid);
	}else solve(mid+1,r);
}
void find_positive(){
	memset(rs,0,sizeof(rs));
	solve(1,n);
	cout<<"A ";
	for(int i=1;i<=n;i++)cout<<rs[i];
    cout<<endl;
}
signed main(){
	cin>>n>>k>>t;
	while(t--)find_positive();
}