#include <bits/stdc++.h>
using namespace std;
int N, T;
double P, p[1005];
double f[1005][1005];
int g[1005][1005];
bool Query(int l, int r) {
	printf("Q ");
	for (auto i = 0; i < N; i++) putchar('0' ^ (i >= l && i <= r));
	putchar('\n');
	fflush(stdout);
	char c; scanf(" %c", &c);
	return (c == 'P');
}
void Solve() {
	int i = 0, j = -1;
	vector<bool> ans(N);
	while (i < N) {
		if (j != i) {
			int k = g[N - i][j - i + 1]; bool x = Query(i, i + k - 1);
			if (x) j = i + k - 1;
			else i += k, j = i - 1;
		}
		else if (j == i) ans[j] = 1, i++;
	}
	printf("A ");
	for (int i = 0; i < N; i++) putchar('0' ^ ans[i]);
	putchar('\n');
	fflush(stdout);
	scanf(" %*c");
}
int main() {
	scanf("%d%lf%d", &N, &P, &T);
	p[0] = 1;
	for (int i = 1; i <= N; i++) p[i] = p[i - 1] * (1 - P);
	for (int i = 1; i <= N; i++) {
		f[i][1] = f[i - 1][0];
		for (int j = 2; j <= i; j++) {
			f[i][j] = 1e18;
			for (int k = 1; k <= j; k++) {
				double t = (1 - p[k]) / (1 - p[j]), w = t * f[i][k] + (1 - t) * f[i - k][j - k] + 1;
				if (w < f[i][j]) f[i][j] = w, g[i][j] = k;
			}
		}
		f[i][0] = 1e18;
		for (int k = 1; k <= i; k++) {
			double w = p[k] * f[i - k][0] + (1 - p[k]) * f[i][k] + 1;
			if (w < f[i][0]) f[i][0] = w, g[i][0] = k;
		}
	}
	while (T--) Solve();
	return 0;
}