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
#include <bits/stdc++.h>
 
using namespace std;

 
#define ll long long
#define ve vector
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

/*
 P - 11
 K - 10
 N - 0
*/
 
signed main() {
    srand(12313);
    string name;
    cin >> name;
    int n;
    int T = 1;
    cin >> n >> T;
    map<char, string> mp;
    mp['P'] = "11";
    mp['K'] = "10";
    mp['N'] = "0";
    while(T--){
        string s;
        cin >> s;
        ve<int> x1, x2;
        for(int i = 0; i < n; i++)
            x1.push_back(rand()&1);
        for(int i = 0; i < n; i++)
            x2.push_back(rand()&1);
        if(name[0] == 'B')
            swap(x1, x2);

        for(int i = 0; i < n; i++){
            s[i] ^= x1[i];
        }
        string t;
        int i = 0, j = 0;
        int cnt = 0;

        auto ask = [&](char c){
            cout << c << endl;
            // cerr << name + " asks: " + c << endl;
            cnt++;
            char x;
            cin >> x;
            return x;
        };
        function<void(int)> try_add = [&](int sc){
            if(i == n && j == n)
                return;
            char x;
            // cerr << name + "#" + to_string(i) + " " + to_string(j) << endl;
            if(i < j || (i == j && sc == 1)){
                x = ask('N');
                i++;
                if(x == 'N'){
                    t += "0";
                    try_add(sc);
                }
                else{
                    t += "1";
                }
            }
            else{
                if(s[j] == '0'){
                    x = ask('N');
                    j++;
                    try_add(sc);
                }
                else if(sc == 1){
                    x = ask('P');
                    j++;
                }
                else{
                    x = ask('K');
                    j++;
                }
            }
        };
        while(j + 1 < n && i + 1 < n){
            char c1;
            if(s[j] == '1'){
                if(s[j+1] == '1')
                    c1 = 'P';
                else c1 = 'K';
            }
            else c1 = 'N';
            char c2 = ask(c1);
            t += mp[c2];
            i += mp[c2].size();
            j += mp[c1].size();
            // cerr << name + "!" + t << endl;
            if((c1 == 'P'&& c2 == 'K') || 
                    (c1 == 'K' && c2 == 'N') ||
                    (c1 == 'N' && c2 == 'P'))
                try_add(1);
            if((c1 == 'K' && c2 == 'P') ||
                    (c1 == 'P' && c2 == 'N') ||
                    (c1 == 'N' && c2 == 'K'))
                try_add(-1);
        }
        if(i < n && j < n){
            char c1 = s[j] == '0' ? 'N' : 'P';
            char c2 = ask(c1);
            i++;
            j++;
            if(c2 == 'N')
                t += "0";
            else t += "1";
            if(c1 == 'N' && c2 == 'P')
                try_add(1);
            else if(c1 == 'P' && c2 == 'N')
                try_add(-1);
        }
        while(i < n){
            char x = ask('N');
            i++;
            if(x == 'N'){
                t += "0";
            }
            else{
                t += "1";
                try_add(1);
            }
        }

        while(j < n){
            char c1 = s[j] == '0' ? 'N' : 'P';
            char x = ask(c1);
            j++;
            if(c1 == 'P')
                try_add(-1);
            
        }
        // cerr << cnt << endl;
        for(int it = 0; it < n; it++)
            t[it] ^= x2[it];
        cout << "! " << t << endl;
    }
}