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
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define mp make_pair
void algosia()
{
    int n , q;
    cin >> n >> q;
    while(q--)
    {
        int a_points = 0 , b_points = 0;
        string s;
        cin >> s;
        string ans = "";
        int i = 0;
        while(i < n)
        {
            if(a_points < b_points)
            {
                cout << "K" << endl;
                char c;
                cin >> c;
                a_points++;
                continue;
            }
            if(b_points < a_points)
            {
                cout << "N" << endl;
                char c;
                cin >> c;
                b_points++;
                continue;
            }
            if(s[i] == '0')
            {
                cout << "P" << endl;
                char c;
                cin >> c;
                if(c == 'P')ans += '0';
                else 
                {
                    a_points++;
                    ans += '1';
                }
            }
            else
            {
                cout << "K" << endl;
                char c;
                cin >> c;
                if(c == 'K')ans += '1';
                else 
                {
                    b_points++;
                    ans += '0';
                }
            }
            i = ans.size();
        }
        cout << "! " << ans << endl;
    }
}
void bajtus()
{
    int n , q;
    cin >> n >> q;
    while(q--)
    {
        int a_points = 0 , b_points = 0;
        string s;
        cin >> s;
        string ans = "";
        int i = 0;
        while(i < n)
        {
            if(a_points < b_points)
            {
                cout << "N" << endl;
                char c;
                cin >> c;
                a_points++;
                continue;
            }
            if(b_points < a_points)
            {
                cout << "K" << endl;
                char c;
                cin >> c;
                b_points++;
                continue;
            }
            if(s[i] == '0')
            {
                cout << "P" << endl;
                char c;
                cin >> c;
                if(c == 'P')ans += '0';
                else
                {
                    b_points++;
                    ans += '1';
                }
            }
            else
            {
                cout << "K" << endl;
                char c;
                cin >> c;
                if(c == 'K')ans += '1';
                else 
                {
                    a_points++;
                    ans += '0';
                }
            }
            i = ans.size();
        }
        cout << "! " << ans << endl;
    }
}
signed main()
{
    string s;
    cin >> s;
    if(s == "Algosia")algosia();
    else bajtus();
    return 0;
}