1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
#include <bits/stdc++.h>
// #include <unistd.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define all(x) x.begin(),x.end()
#define V vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int mod = 1e09+7;
int add(int a, int b) { return a+b >= mod ? a+b-mod : a+b; }
int sub(int a, int b) { return add(mod-b, a); }
int mul(int a, int b) { return int(a*ll(b)%mod); }
__int128_t fpow(__int128_t a, int b) {
    __int128_t res = 1;
    while (b) {
        if (b & 1) res *= a;
        b >>= 1, a *= a;
    }
    return res;
}
void answer(int n, int who) { // PAMIETAC O FLUSHU!
    map<int, char> n_to_l = {{0, 'P'}, {1, 'K'}, {2, 'N'}};
    map<char, int> l_to_n = {{'P', 0}, {'K', 1}, {'N', 2}};
    map<pair<char, char>, int> delta_cnt = { // ja - first, drugi gracz - second
        {{'P', 'K'}, 1}, {{'K', 'P'}, -1},
        {{'K', 'N'}, 1}, {{'N', 'K'}, -1},
        {{'N', 'P'}, 1}, {{'P', 'N'}, -1},
    };

    mt19937 rng(15050534); // rngesus :(((((((((((((((
    V<V<int>> mask(2, V<int>(n));
    for (int cnt = 0; cnt < 20; ++cnt)
        for (int z = 0; z < 2; ++z)
            for (int i = 0; i < n; ++i) mask[z][i] ^= rng() % 2;

    string input; cin >> input;
    V<int> a(n+1, 0), b(n+1, 0); a[n] = 1;
    for (int i = 0; i < n; ++i) a[i] = int(input[i]-'0') ^ mask[who][i];

    V<int> rounds = {0, 0};

    int p_a = 0, p_b = 0, delta = 0;
    int l_a = -1, l_b = -1;
    __int128_t partial = 0;
    int b_len = 103, t_len = 65, curr_len = 0; // 84 53, 19 12, 11 7, 3 2
    __int128_t X = 0;
    while (p_a < n || p_b < n) {
        int r = rng() % 2;
        ++rounds[abs(delta)];
        if (!delta) { // remis
            if (curr_len) {
                __int128_t x = (X / fpow(3, curr_len)) % 3;
                char c = n_to_l[int(x)], c2;
                cout << c; cout.flush(); cin >> c2;
                // if (who == 0) fprintf(stderr, "%c\n", c);
                
                partial += l_to_n[c2]*fpow(3, curr_len);
                delta += delta_cnt[{c, c2}];
                curr_len = (curr_len+1) % t_len;

                if (!curr_len) {
                    for (int i = 0; i < b_len; ++i, partial >>= 1)
                        b[l_b+i] = int(partial & 1);
                    l_a = -1, l_b = -1;
                }
            }
            else if (n - max(p_a, p_b) >= 3) {
                if (n - max(p_a, p_b) < n / 2 && b_len == 103) b_len = 30, t_len = 19;
                if (n - max(p_a, p_b) < b_len) b_len = 19, t_len = 12;
                if (n - max(p_a, p_b) < b_len) b_len = 11, t_len = 7;
                if (n - max(p_a, p_b) < b_len) b_len = 3, t_len = 2;
                // if (who == 0) fprintf(stderr, "b\n");
                l_a = p_a, l_b = p_b;
                p_a += b_len, p_b += b_len;
                X = 0;
                for (int i = 0; i < b_len; ++i) X += (__int128_t(a[l_a+i]) << i);
                // if (who == 0) fprintf(stderr, "X: %d\n", X);

                __int128_t x = X % 3;
                char c = n_to_l[int(x)], c2;
                cout << c; cout.flush(); cin >> c2;

                partial = l_to_n[c2];
                delta += delta_cnt[{c, c2}];
                curr_len = (curr_len+1) % t_len;
            }
            else {
                // if (who == 0) fprintf(stderr, "c\n");
                char c = (a[p_a] == r) ? 'P' : 'K', c2;
                cout << c; cout.flush(); cin >> c2;
                b[p_b] = (c2 == 'P') ? r : r^1;
                p_a += (p_a < n), p_b += (p_b < n);
                delta += delta_cnt[{c, c2}];
            }
        }
        else if (delta == -1) { // ja przegrywam
            if (p_a < p_b || (p_a == p_b && who == 0)) {
                char c = (a[p_a] == r) ? 'P' : 'K';
                delta += (c == 'P') ? 1 : 0;
                cout << c; cout.flush();
                cin >> c;
                ++p_a;
            }
            else {
                cout << "P", cout.flush();
                char c; cin >> c;
                delta += (c == 'K') ? 1 : 0;
                b[p_b++] = (c == 'P') ? r : (r^1);
            }
        }
        else { // ja wygrywam
            if (p_a > p_b || (p_a == p_b && who == 1)) {
                cout << "K", cout.flush();
                char c; cin >> c;
                delta += (c == 'P') ? -1 : 0;
                b[p_b++] = (c == 'P') ? r : (r^1);
            }
            else {
                char c = (a[p_a] == r) ? 'P' : 'K';
                delta += (c == 'K') ? -1 : 0;
                cout << c; cout.flush();
                cin >> c;
                ++p_a;
            }
        }
        assert(abs(delta) < 2);
    }

    // if (who == 0) fprintf(stderr, "END\n");

    // if (who == 0) fprintf(stderr, "%d %d %lf\n", rounds[0], rounds[1], rounds[0]*double(2*b_len)/t_len + rounds[1]);
    
    while (curr_len) {
        char c, c2;
        if (delta == -1)
            cout << 'P', cout.flush(), cin >> c, ++delta;
        else if (delta == 1)
            cout << 'K', cout.flush(), cin >> c, --delta;
        
        __int128_t x = (X / fpow(3, curr_len)) % 3;
        c = n_to_l[int(x)];
        cout << c; cout.flush(); cin >> c2;
        
        partial += l_to_n[c2]*fpow(3, curr_len);
        delta += delta_cnt[{c, c2}];
        curr_len = (curr_len+1) % t_len;

        if (!curr_len) {
            for (int i = 0; i < b_len; ++i, partial >>= 1)
                b[l_b+i] = int(partial & 1);
            l_a = -1, l_b = -1;
        }
    }
    
    // if (who == 1) usleep(5000), fprintf(stderr, "Bajtek:\n");
    // else fprintf(stderr, "Algosia:\n");
    // for (int i = 0; i < n; ++i) fprintf(stderr, "%d", a[i]);
    // fprintf(stderr, "\n");
    // for (int i = 0; i < n; ++i) fprintf(stderr, "%d", b[i]);
    // fprintf(stderr, "\n");

    cout << "! ";
    for (int i = 0; i < n; ++i) cout << (b[i] ^ mask[who^1][i]);
    // cout << endl;
    cout.flush();
}
int main() {
    // ios_base::sync_with_stdio(0); cin.tie(0);
    string str; cin >> str;
    int T = 1, n; cin >> n >> T;
    for (++T; --T; ) answer(n, (str[0] == 'A') ? 0 : 1);
    return 0;
}