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
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define all(x) (x).begin(), (x).end()

struct xd{
    int ile;
    int co;
};

const int bit_amount=50;
string s;
char ja;
char on;
bool czyjawie;
bool czyonwie;
int n, t, cnt, jazg, onzg, m;
int jal, jar, onl, onr;
int bilans;
vector<int> jaciag;
vector<int> jacg;
vector<int> onciag;
vector<int> oncg;
vector<int> zm;

mt19937 mt(213742069);

int rng(int a, int b){
    assert(a<=b);
    return mt()%(b-a+1)+a;
}

void zgaduj(){
    if(onr-onl<=1){
        onzg=min(onzg+1, m);
        onr=1ll<<bit_amount;
        onl=0;
    }
    if(jar-jal<=1){
        oncg.push_back(jal);
        jazg=min(jazg+1, m);
        jar=1ll<<bit_amount;
        jal=0;
    }
}

void komunikuj(){
    // cout << jazg << ' ' << onzg << '|' << jal << ' ' << jar << '|' << onl << ' ' << onr << '|' << jacg[onzg] << ' ';
    cout << ja << '\n';cout.flush();
    cin >> on;
    if(ja=='P'){
        if(on=='K') bilans++;
        if(on=='N') bilans--;
    }
    if(ja=='K'){
        if(on=='N') bilans++;
        if(on=='P') bilans--;
    }
    if(ja=='N'){
        if(on=='P') bilans++;
        if(on=='K') bilans--;
    }
}

void napraw_bilans(){
    if(jazg>=m && onzg>=m) return;
    // cout << "nb ";
    if(jazg<onzg || (jazg==onzg && s[0]=='A')){
        // cout << "jp ";
        ja='P';
        komunikuj();
        int s=(jal*3+jar)/4;
        if(on=='P'){
            jar=s+1;
            zgaduj();
        }
        else{
            jal=s+1;
            zgaduj();
        }
    }
    else{
        int s = (onl*3+onr)/4;
        if(jacg[onzg]<=s){
            ja='P';
            onr=s+1;
            zgaduj();
        }
        else{
            onl=s+1;
            zgaduj();
            if(bilans==1){
                ja='K';
            }
            else{
                ja='N';
            }
        }
        komunikuj();
    } 
}

void solve() {
    cnt=0;
    bilans=0;
    jazg=0;
    onzg=0;
    jaciag.clear();
    onciag.clear();
    jacg.clear();
    oncg.clear();
    zm.clear();
    int i, j, a, b, p, v;
    for(i=0; i<n; i++){
        char c;
        cin >> c;
        jaciag.push_back(c-'0');
        onciag.push_back(-1);
        zm.push_back(rng(0,1));
        // zm.push_back(0);
        jaciag.back()+=zm.back();
        jaciag.back()%=2;
    }
    while(jaciag.size()%bit_amount>0){
        jaciag.push_back(0);
        onciag.push_back(-1);
    }
    for(i=0; i<jaciag.size(); i+=bit_amount){
        a=0;
        for(j=0; j<bit_amount; j++){
            a*=2;
            a+=jaciag[i+j];
        }
        jacg.push_back(a);
    }
    m = jacg.size();
    jal=0;
    jar=1ll<<bit_amount;
    onl=0;
    onr=1ll<<bit_amount;
    while(jazg<m || onzg<m){
        jazg=min(jazg, m);
        onzg=min(onzg, m);
        while(bilans!=0 && (jazg<m || onzg<m)) napraw_bilans();
        if(jazg>=m && onzg>=m) break;
        jazg=min(jazg, m);
        onzg=min(onzg, m);
        int s1=(onl*2+onr)/3;
        int s2=(onl+onr*2)/3;
        if(jacg[onzg]>s2){
            ja='P';
            onl=s2+1;
        }
        else if(jacg[onzg]>s1){
            ja='K';
            onl=s1+1;
            onr=s2+1;
        }
        else{
            ja='N';
            onr=s1+1;
        }
        komunikuj();
        s1=(jal*2+jar)/3;
        s2=(jal+jar*2)/3;
        if(on=='P'){
            jal=s2+1;
        }
        else if(on=='K'){
            jal=s1+1;
            jar=s2+1;
        }
        else{
            jar=s1+1;
        }
        zgaduj();
    }
    for(i=0; i<m; i++){
        a=oncg[i];
        for(j=bit_amount-1; j>=0; j--){
            onciag[i*bit_amount+j]=a%2;
            a/=2;
        }
    }
    cout << "! ";
    for(i=0; i<n; i++){
        cout << (onciag[i]+zm[i])%2;
    }
    cout << '\n';cout.flush();
}

signed main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> s;
    cin >> n >> t;
    while(t-- ) solve();
}