#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

mt19937 rnd(time(NULL));

double rand_d() {
    return (double)(rnd() % RAND_MAX) / RAND_MAX;
}

void rsh(vector<int> &x) {
    for (int i = 1; i < x.size(); i++) {
        swap(x[i], x[rnd() % (i + 1)]);
    }
}   

vector<int> fs = {4530, 15330, 28470, 57450, 73890, 109860, 147090, 191730, 219420};

void solve(int tc) {
    int n, t; 
    double p; cin >> n >> p >> t;

    for (int _ = 0; _ < t; _++) {
        vector<int> res(n);
        for (int i = 0; i < n; i++) {
            res[i] = rand_d() <= p;
        }
        auto ask = [&](string s) -> bool {
            #ifdef LOCAL 
                int ans = 0;
                for (int i = 0; i < n; i++) {
                    if (s[i] == '1') ans |= res[i];
                }
                return ans;
            #else
                cout << "Q " << s << endl;
                char c; cin >> c;
                return (c == 'P');
            #endif
        };
        auto check = [&](string ans) {
            #ifdef LOCAL 
                for (int i = 0; i < n; i++) {
                    if (ans[i] - '0' != res[i]) return false;
                }
                return true;
            #else
                cout << "A " << ans << endl;
                char c; cin >> c;
                return (c == 'C');
            #endif
        };

        string ans, req;
        for (int i = 0; i < n; i++) {
            ans += '0';
            req += '0';
        }
        auto solve = [&](int l, int r, bool need_check, auto&&solve) -> bool {
            if (need_check) {
                for (int i = l; i < r; i++) req[i] = '1';
                bool rs = ask(req);
                for (int i = l; i < r; i++) req[i] = '0';
                if (!rs) return false;
            }
            if (l + 1 == r) {
                ans[l] = '1';
                return true;
            }
            if (l + 2 == r) {
                req[l] = '1';
                bool rs = ask(req);
                if (!rs) {
                    ans[l + 1] = '1';
                    req[l] = '0';
                    return true;
                }
                ans[l] = '1';
                req[l] = '0';
                req[l + 1] = '1';
                if (ask(req)) ans[l + 1] = '1';
                req[l + 1] = '0';
                return true;
            }   
            int m = (l + r) / 2;
            bool nch = solve(l, m, true, solve);
            solve(m, r, nch, solve);
            return true;
        };
        if (p == 0.2) {
            int K = 2;
            for (int i = 0; i < n; i+=K) {
                for (int j = i; j < min(n, i + K); j++) req[j] = '1';
                bool answ = ask(req);
                for (int j = i; j < min(n, i + K); j++) req[j] = '0';
                if (answ) {
                    for (int j = i; j < min(n,i+K); j++) {
                        req[j] = '1';
                        if (ask(req)) {
                            ans[j] = '1'; 
                            req[j] = '0'; 
                            continue;
                        }
                        else {
                            if (j < min(n, i + K) - 1) {
                                ans[j + 1] = '1'; 
                                req[j] = '0';
                            }
                            break;
                        }
                    }
                }
            }
            assert(check(ans));
        }
        else if (p >= 0.1) {
            int K = 4;
            for (int i = 0; i < n; i+=K) {
                for (int j = i; j < min(n, i + K); j++) req[j] = '1';
                bool answ = ask(req);
                for (int j = i; j < min(n, i + K); j++) req[j] = '0';
                if (answ) {
                    int m = (i + min(n, i + K)) / 2;
                    solve(i, m, true, solve);
                    solve(m, min(n, i + K), true, solve);
                }
            }
            assert(check(ans));
        } else if (p <= 0.005256) {
            solve(0, n, true, solve);
            assert(check(ans));   
        } else {
            int K = 100;
            for (int i = 0; i < n; i+=K) {
                for (int j = i; j < min(n, i + K); j++) req[j] = '1';
                bool answ = ask(req);
                for (int j = i; j < min(n, i + K); j++) req[j] = '0';
                if (answ) {
                    solve(i, min(i + K, n), false, solve);
                }
            }
            assert(check(ans));
        }
    } 
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #endif

    for (int i = 0; i < tt; i++) {
        solve(i);
    }

    return 0;
}