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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
#include <bits/stdc++.h>
using namespace std;

string kto;
int n;

int nowy_balans(char ja, char on) {
    if (ja == on) return 0;
    if (ja == 'P' && on == 'K') return 1;
    if (ja == 'K' && on == 'N') return 1;
    if (ja == 'N' && on == 'P') return 1;
    return -1; 
}

char graj(char ja, int&bilans){
    cout << ja << '\n';
    cout.flush();
    char on; cin >> on;
    bilans += nowy_balans(ja, on);
    assert(abs(bilans) < 2);
    return on;
}

void gierka() {
    vector<int>zalosuj(n);
    vector<int>a(n);
    for (int i = 0; i < n; i++){
        char c; cin >> c;
        zalosuj[i] = rand() % 2;
        a[i] = (c == '1' ? 1 : 0);
        a[i] ^= zalosuj[i];
    }
    int bilans = 0;
    int i = 0;
    vector<int>b(n, -1);
    function<void()> graj_on_ma_wiecej;
    function<void()> graj_ja_mam_wiecej;

    graj_on_ma_wiecej = [&]() {
        assert(bilans != 0);
        assert(i + 1 < n);
        if (i + 2 >= n) {
            // zostal jeden bit
            char ja = (a[i + 1] == 0 ? 'P' : 'K');
            char on = graj(ja, bilans);
            i += 2;
            return;
        } 
        // zostaly przynajmniej dwa bity
        char expected_tie = (bilans == 1 ? 'P' : 'K');
        char expected_winlose = (bilans == 1 ? 'K' : 'P');
        char ja = (a[i + 1] == 0 && a[i + 2] == 0 ? expected_tie : expected_winlose);
        char on = graj(ja, bilans);
        
        if (ja == expected_tie) {
            i++;
            graj_ja_mam_wiecej();
            return;
        }
        assert(bilans == 0);
        char ja2 = 'P'; // 01
        if (a[i + 1] == 1 && a[i + 2] == 0) ja2 = 'K';
        if (a[i + 1] == 1 && a[i + 2] == 1) ja2 = 'N';
        char on2 = graj(ja2, bilans); 
        if (i + 3 >= n) {
            b[i + 2] = (on2 == 'P' ? 0 : 1);
            i += 3;
            return;
        }
        if (on2 == 'P') {
            b[i + 2] = 0; b[i + 3] = 0;
            if (bilans == 0) {
                i += 3;
            } else {
                i += 2;
                graj_on_ma_wiecej();

            }
            return;
        } else if (on2 == 'K') {
            b[i + 2] = 0; b[i + 3] = 1;
            if (bilans == 0) {
                i += 3;
            } else {
                i += 2;
                graj_on_ma_wiecej();
            }
            return;
        } else {
            b[i + 2] = 1;
        }
        
        if (bilans != 0) {
            graj(bilans == 1 ? 'K' : 'N', bilans);
        }
        assert(bilans == 0);
        i += 3;
    };

    graj_ja_mam_wiecej = [&]() {
        assert(bilans != 0);
        int bal_przed = bilans;
        if (i + 1 == n - 1) {
            char on = (bilans == 1 ? 'K' : 'P');
            char ja = graj(on, bilans);
            b[i + 1] = (ja == 'P' ? 0 : 1);
            i += 2;
            return;
        }
        char on = (bal_przed == 1 ? 'K' : 'P');
        char ja = graj(on, bilans);

        char expected_tie = (bal_przed == 1 ? 'K' : 'P');
        
        if (ja == expected_tie) {
            b[i + 1] = 0; b[i + 2] = 0;
            i++;
            graj_on_ma_wiecej();
            return;
        }
        assert(bilans == 0);
        if (i + 3 >= n) {
            char on2 = (a[i + 2] == 0 ? 'P' : 'K');
            char ja2 = graj(on2, bilans);
            if (ja2 == 'P') {
                b[i + 1] = 0; b[i + 2] = 1;
            } else if (ja2 == 'K') {
                b[i + 1] = 1; b[i + 2] = 0;
            } else {
                b[i + 1] = 1; b[i + 2] = 1;
            }
            i += 3;
            return;
        }
        char on2;
        if (a[i + 2] == 0 && a[i + 3] == 0) on2 = 'P';
        if (a[i + 2] == 0 && a[i + 3] == 1) on2 = 'K';
        if (a[i + 2] == 1) on2 = 'N';

        char ja2 = graj(on2, bilans);
        if (ja2 == 'P') {
            b[i + 1] = 0; b[i + 2] = 1;
        } else if (ja2 == 'K') {
            b[i + 1] = 1; b[i + 2] = 0;
        } else {
            b[i + 1] = 1; b[i + 2] = 1;
        }
        if (on2 != 'N') {
            if (bilans == 0) {
                i += 3;
            } else {
                i += 2;
                graj_ja_mam_wiecej();
            }
            // i += 2;
            // graj_ja_mam_wiecej();
            return;
        }
        
        if (bilans != 0) graj('P', bilans);
        assert(bilans == 0);
        i += 3;
    };
    while (i < n) {
        assert(bilans == 0);

        if (i + 1 >= n) {
            char ja = (a[i] == 0 ? 'P' : 'K');
            char on = graj(ja, bilans);
            b[i] = (on == 'K') ? 1 : 0;
            break;
        }
        char ja;
        if (a[i] == 0 && a[i + 1] == 0) {
            ja = 'P';
        } else if (a[i] == 0 && a[i + 1] == 1) {
            ja = 'K';
        } else { // a[i] = 1
            ja = 'N';
        }
        char on = graj(ja, bilans);
        if (on == 'P') {
            b[i] = 0;
            b[i + 1] = 0;
        } else if (on == 'K') {
            b[i] = 0;
            b[i + 1] = 1;
        } else {
            b[i] = 1;
        }

        if (ja == 'N' && on == 'N') {
            i++;
            continue;
        }
        if (ja != 'N' && on != 'N') {
            if (bilans != 0) {
                char ja = (bilans == -1 ? 'K' : 'N');
                graj(ja, bilans);
            }
            assert(bilans == 0);
            i += 2;
            continue;
        }
        if (ja == 'N') {
            // ja mam 1..., on ma 0x
            graj_on_ma_wiecej();
        } else {
            graj_ja_mam_wiecej();
        }
    }
    // cerr << kto << endl;
    // for (auto x: b) cerr << x << " ";
    // cerr << endl;

    cout << "! ";
    for (int j = 0; j < n; j++){
        b[j] ^= zalosuj[j];
        cout << b[j];
    }
    cout << '\n';
    cout.flush();
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> kto;
    int t; cin >> n >> t;
    srand(676769);
    while (t--) gierka();
    return 0;
}