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
/*
Runda 2 - 
*/

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <chrono>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef vector<PLL > VPLL;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<class T> using max_heap = priority_queue<T>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

string name;
int n, t;
string my, other;
int score = 0;
int sent = 0;

int updateScore(char myMove, char otherMove) {
    if (myMove == otherMove) return score;
    if (myMove == 'P') return (otherMove == 'K' ? score++ : score--);
    if (myMove == 'K') return (otherMove == 'N' ? score++ : score--);
    if (myMove == 'N') return (otherMove == 'P' ? score++ : score--);
    return score;
}

void round() {
    char toSend;
    if (sent < n && score <= 0) {
        toSend = (my[sent] == '1' ? 'N' : 'P');
        sent++;
    } else toSend = (score < 0 ? 'N' : 'P');
    cout << toSend << '\n'; cout.flush();
    char c; cin >> c;
    bool correctBit = (score >= 0 && other.size() < n);
    updateScore(toSend, c);
    if (correctBit) other.PB(c == 'P' ? '0' : '1');
}

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    cin >> name;
    cin >> n >> t;
    other.reserve(n);
    while (t--) {
        score = sent = 0;
        cin >> my; other.clear();
        while (sent < n || other.size() < n) {
            round();
            cerr << "sent: " << sent << ", read: " << other.size() << '\n'; cerr.flush();
            cerr << "other: " << other << '\n'; cerr.flush();
        }
        
        cerr << "finish!\n";
        cout << "! " << other << "\n"; cout.flush();
    }

    return 0;
}