#include <stdio.h>
#include <string.h>
#define N 1000
int min(int a, int b) { return a < b ? a : b; }
unsigned int Z = 12345;
int rand_() {
return (Z *= 3) >> 1;
}
int n, m; double p;
int query(int l, int r) {
static char cc[N + 1], s[2];
memset(cc, '0', n * sizeof *cc), memset(cc + l, '1', (r - l) * sizeof *cc);
printf("Q %s\n", cc), fflush(stdout);
scanf("%s", s);
return s[0] == 'P';
}
int main() {
int t, subtask;
scanf("%d%lf%d", &n, &p, &t), m = 1 / p / 2, subtask = t == 1 ? 1 : 2;
while (t--) {
static char cc[N + 1];
int i, l, r, lower, upper;
memset(cc, '0', n * sizeof *cc), cc[n] = 0;
if (subtask == 1) {
for (i = 0; i < n; i++)
if (query(i, i + 1))
cc[i] = '1';
} else {
l = 0;
while (l < n) {
r = min(l + m, n);
lower = l, upper = r + 1;
while (upper - lower > 1) {
i = (lower + upper) / 2;
if (query(l, i))
upper = i;
else
lower = i;
}
if (lower < r)
cc[lower] = '1', l = lower + 1;
else
l = lower;
}
}
printf("A %s\n", cc), fflush(stdout);
scanf("%*s");
}
return 0;
}
