#include <bits/stdc++.h>

using namespace std;
using db = double;

int N, T;

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);
    if (T == 1 && N == 1000) {
        vector<bool> check(N);
        for (int i = 0; i < N; ++i) {
            check[i] = true;
            if (test_students(check)) {
                answer[i] = true;
            }
            check[i] = false;
        }
        return answer;
    }
    auto check = [&](int l, int r) {
        vector<bool> c(N);
        fill(c.begin() + l, c.begin() + r, true);
        return test_students(c);
    };
    int step = 0.75 / P;
    if (P > 0.04 && P < 0.1) {
        step = 0.66 / P;
    }
    for (int i = 0; i < N; ) {
        if (!check(i, min(i + step, N))) {
            i += step;
            continue;
        }
        int lo = i, hi = min(i + step, N);
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (check(i, mid)) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        answer[lo] = true;
        i = hi;
    }
    return answer;
}

int main() {
    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;
}