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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const vector<vector<char>> v = {{'P', 'K'}, {'K', 'N'}};
int win[256][256];
char decode[2][256];

int n, is_first;

void solve() {
  string s, res;
  cin >> s;
  
  int bal = 0;
  
  int i = 0;
  char a, b;
  while(i < n) {
    if(!bal) {
      a = v[is_first][s[i] - '0'];
      cout << a << endl;
      cin >> b;
      bal += win[a][b];
      i++;
      res += decode[is_first][b];
    } else {
      cout << b << endl;
      cin >> a;
      bal = 0;
    }
  }
  
  cout << "! " << res << endl;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  
  string s = "PKN";
  for(int i = 0; i < 3; i++) {
    char a = s[i];
    char b = s[(i + 1) % 3];
    win[a][b] = 1;
    win[b][a] = -1;
  }
  for(int i = 0; i < 2; i++) {
    for(int j = 0; j < 2; j++) {
      decode[i][v[i ^ 1][j]] = j + '0';
    }
  }

  string name;
  int t;
  cin >> name >> n >> t;
  is_first = name[0] == 'A';
  while(t--) solve();
}