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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back
mt19937 rng(67);
ll N = 5000;
vc<ll> ar, br;
bool T;
ll n;

vc<ll> c23(vc<ll> &a) {
	ll x = 0;
	for (ll i = 0; i < 11; i++)
		if (a[i])
			x |= (1ll << i);
	vc<ll> ret(7);
	for (ll i = 0; i < 7; i++) {
		ret[i] = x % 3;
		x /= 3;
	}
	return ret;
}

vc<ll> c32(vc<ll> &a) {
	ll x = 0;
	for (ll i = 6; i >= 0; i--) {
		x *= 3;
		x += a[i];
	}
	vc<ll> ret(11);
	for (ll i = 0; i < 11; i++) {
		ret[i] = x % 2;
		x /= 2;
	}
	return ret;
}

void prepro() {
	ar.resize(N);
	br.resize(N);
	for (ll i = 0; i < N; i++)
		ar[i] = rng() % 2;
	for (ll i = 0; i < N; i++)
		br[i] = rng() % 2;
	if (T)
		swap(ar, br);
}

vc<ll> totc23(vc<ll> a) {
	while (sz(a) % 11 != 0)
		a.pub(0);
	vc<ll> ret;
	for (ll i = 0; i < sz(a); i+= 11) {
		vc<ll> b;
		for (ll j = 0; j < 11; j++)
			b.pub(a[i + j]);
		b = c23(b);
		for (ll x : b)
			ret.pub(x);
	}
	return ret;
}

string pkn = "PKN";

ll mtoi(string s) {
	for (ll i = 0; i < 3; i++)
		if (s[0] == pkn[i])
			return i;
	assert(false);
	return -1;
}

void program() {
	vc<ll> a(n, -1), b(n, -1);
	string str;
	cin >> str;
	for (ll i = 0; i < n; i++) {
		a[i] = str[i] == '1';
		a[i] = a[i] ^ ar[i];
	}
	
	vc<ll> a3 = totc23(a);
	ll oc = 0;

	ll rca = 0, rcb = 0;
	vc<ll> b3;
		
	ll W = 0;
	while (true) {
		if ((sz(b3) / 7) * 11 + rcb >= n and (oc / 7) * 11 + rca >= n)
			break;
		if (W == 0) {
			ll ca = a3[oc++];
			cout << pkn[ca] << endl;
			cin >> str;
			ll cb = mtoi(str);
			b3.pub(cb);
			if ((ca + 1) % 3 == cb)
				W = 1;
			if (ca == (cb + 1) % 3)
				W = -1;
		} else if (rca < rcb or (rca == rcb and T == 0)) {
			ll ca = a[n - rca - 1];
			rca++;
			cout << pkn[ca] << endl;
			cin >> str;
			ll cb = mtoi(str);
			if (ca != cb)
				W = 0;
		} else  {
			ll ca;
			if (W == 1)
				ca = 1;
			else
				ca = 0;
			cout << pkn[ca] << endl;
			cin >> str;
			ll cb = mtoi(str);
			b[n - rcb - 1] = cb;
			rcb++;
			if (ca != cb)
				W = 0;
		}
	}
	for (ll i = 0; i + 6 < sz(b3); i += 7) {
		vc<ll> f;
		for (ll j = 0; j < 7; j++)
			f.pub(b3[i + j]);
		f = c32(f);
		for (ll j = 0; j < 11; j++) {
			ll k = (i / 7) * 11 + j;
			if (k < n and b[k] == -1)
				b[k] = f[j];
		}
	}
	cout << "! ";
	for (ll i = 0; i < n; i++)
		b[i] = b[i] ^ br[i];
	for (ll &bi : b)
		cout << bi;
	cout << endl;
}

int main() {
	string str;
	cin >> str;
	T = str == "Bajtek";
	prepro();
	ll t;
	cin >> n >> t;
	while (t--)
		program();
	return 0;
}