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
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#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 VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 410;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;
const int MAGIC = 1585;
const int MAGIC2 = 1000;

int n, t;
int zn[1111];
bool role;
vector<int> mask;

int div_mod(VI &vec, int b) {
	int res = 0;
	FOR(i, 0, SIZE(vec) - 1) {
		int curr = 2 * res + vec[i];
		vec[i] = curr / b;
		res =  curr % b;
	}
	return res;
}

void mult_add(VI &vec, int b, int c) {
	FORD(i, n - 1, 0) {
		c += vec[i] * b;
		vec[i] = c & 1;
		c >>= 1;
	}
}

int wynik(int move, int enemy_move) {
	if(move == enemy_move)
		return 0;
	int tmp = ((move + 1) % 3 == enemy_move) ? 1 : -1;
	if(!role)
		return -tmp;
	return tmp;
}

PII turn(int move, int score) {
	cout<<"PKN"[move]<<'\n';
	cout.flush();
	char c;
	cin>>c;
	score += wynik(move, zn[c]);
	return {zn[c], score};
}

void test() {
	string a;
	cin>>a;
	VI b(n);
	FOR(i, 0, n - 1)
		b[i] = (a[i] - '0') ^ mask[i];
	vector<PII> rec;

	int a_sent = 0, b_sent = 0;
	int max = n * MAGIC2 + MAGIC;
	int score = 0;
	int fix_turn = 0;
	int visit_cnt = 0;

	while(a_sent < max || b_sent < max) {
		int move, enemy_move;
		if(score == 0) {
			move = div_mod(b, 3);
			PII p1 = turn(move, score);
			enemy_move = p1.F;
			score = p1.S;
			rec.PB({3, enemy_move});
			a_sent += MAGIC;
			b_sent += MAGIC;

			if(score != 0) {
				fix_turn = visit_cnt & 1;
				visit_cnt++;
			}
		}
		else {
			bool qq = (score > 0) == !fix_turn;
			PII p1;
			if(fix_turn ^ role) {
				move = div_mod(b, 2) ? 2 : qq;
				p1 = turn(move, score);
			}
			else {
				move = qq;
				p1 = turn(move, score);
				rec.PB({2, p1.F == 2});
			}

			enemy_move = p1.F;
			score = p1.S;
			if(!fix_turn)
				a_sent += MAGIC2;
			else
				b_sent += MAGIC2;
			if(score)
				fix_turn ^= 1;
		}
	}

	VI res(n, 0);
	FORD(i, SIZE(rec) - 1, 0)
		mult_add(res, rec[i].F, rec[i].S);
	string ans(n, '0');
	FOR(i, 0, n - 1)
		ans[i] = '0' + (res[i] ^ mask[i]);
	cout<<"! "<<ans<<"\n";
	cout.flush();
}

int main() {
	mask.resize(5000);
	srand(999);
	FOR(i, 0, 4999)
		mask[i] = rand() & 1;
	zn['P'] = 0;
	zn['K'] = 1;
	zn['N'] = 2;
	string name;
	cin>>name;
	role = name[0] == 'A';
	int te;
	scanf("%d %d", &n, &te);
	while(te--)
		test();
	return 0;
}