#include <bits/stdc++.h>

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';
}

// std::vector<bool> find_positive() {
//   std::vector<bool> answer(N);
//   for (int i = 0; i < N; ++i) {
//     std::vector<bool> vec(N);
//     vec[i] = 1;
//     if (test_students(vec)) answer[i] = 1;
//   }
//   return answer;
// }
std::vector<bool> find_positive() {
    std::vector<bool> answer(N);
        for (int i = 0; i < N; ++i){
            std::vector<bool>msk(N);
            msk[i]=1;
            if(test_students(msk))answer[i]=1;
        }
        return answer;
    
}

int main() {
  int T;
  scanf("%d %lf %d", &N, &P, &T);
  for (int i = 0; i < T; i++) {
    std::vector<bool> answer = find_positive();
    assert(answer.size() == (size_t)N);

    std::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;
}