#include<bits/stdc++.h>

using namespace std;
using R=double;

template<class A,class B>
bool chkmin(A &t,B x){ return t>x?t=x,1:0; }

int N,T;
R P;

vector<R> dp;
vector<int> from;

vector<int> res,p;
mt19937 gen(time(0));

int query(int l,int r){
  cout<<"Q ";
  for(int i=1; i<=N; i++){
    if(l<=p[i]&&p[i]<=r) cout<<1;
    else cout<<0;
  }
  cout<<endl;
  char t;
  cin>>t;
  return t=='P';
}

void construct(int l,int r){
  if(l>r) return;
  if(l==r){
    res[p[l]]=query(l,r);
    return ;
  }
  int len=from[r-l+1];
  assert(len);
  int pt=query(r-len+1,r);
  if(pt){
    if(len==1){
      res[p[r]]=1;
    }
    else{
      construct(r-len+1,r);
    }
  }
  construct(l,r-len);
}

void solve(){
  shuffle(p.begin()+1,p.end(),gen);
  res=vector<int>(N+1);

  if(query(1,N)) construct(1,N);

  cout<<"A ";
  for(int i=1; i<=N; i++){
    cout<<res[i];
  }
  cout<<endl;

  char res;
  cin>>res;
  assert(res=='C');

}

int main(){

  cin>>N>>P>>T;

  dp.assign(N+1,1e9);
  from.resize(N+1);
  dp[0]=0,dp[1]=1;
  from[1]=1;

  for(int i=1; i<=N; i++){
    R coef=1;
    for(int j=1; j<i; j++){
      coef=coef*(1-P);
      if(chkmin(dp[i],dp[i-j]+1+(dp[j])*(1-coef))){
        from[i]=j;
      }
    }
    //cerr<<i<<' '<<from[i]<<endl;
    //cerr<<i<<' '<<dp[i]<<endl;
  }

  p=vector<int>(N+1);
  for(int i=1; i<=N; i++) p[i]=i;

  while(T--) solve();

  return 0;
}