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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdint>

using namespace std;

struct BigInt {
    vector<uint64_t> d;

    BigInt() { d.push_back(0); }

    void from_binary(const string& s) {
        d.clear();
        d.push_back(0);
        for (char c : s) {
            mul_add(2, c - '0');
        }
    }

    void mul_add(uint64_t m, uint64_t r) {
        uint64_t carry = r;
        for (size_t i = 0; i < d.size(); i++) {
            uint64_t low = d[i] & 0xFFFFFFFF;
            uint64_t high = d[i] >> 32;

            uint64_t res_low = low * m + carry;
            uint64_t res_high = high * m + (res_low >> 32);

            d[i] = (res_low & 0xFFFFFFFF) | (res_high << 32);
            carry = res_high >> 32;
        }
        if (carry) d.push_back(carry);
        while (d.size() > 1 && d.back() == 0) d.pop_back();
    }

    int div_mod(uint64_t m) {
        uint64_t rem = 0;
        for (int i = (int)d.size() - 1; i >= 0; i--) {
            uint64_t current = d[i];
            uint64_t upper = (rem << 32) | (current >> 32);
            uint64_t q_upper = upper / m;
            rem = upper % m;

            uint64_t lower = (rem << 32) | (current & 0xFFFFFFFF);
            uint64_t q_lower = lower / m;
            rem = lower % m;

            d[i] = (q_upper << 32) | q_lower;
        }
        while (d.size() > 1 && d.back() == 0) d.pop_back();
        return (int)rem;
    }

    // POPRAWIONA METODA ADD - Zgodna z Visual Studio (MSVC)
    void add(const BigInt& other) {
        uint64_t carry = 0;
        size_t n = max(d.size(), other.d.size());
        for (size_t i = 0; i < n || carry; ++i) {
            if (i == d.size()) d.push_back(0);
            uint64_t val_other = (i < other.d.size() ? other.d[i] : 0);

            // Sumowanie z ręcznym sprawdzaniem carry (standardowe dla uint64)
            uint64_t next_carry = 0;

            // 1. Dodaj poprzedni carry
            uint64_t prev = d[i];
            d[i] += carry;
            if (d[i] < prev) next_carry = 1;

            // 2. Dodaj wartość z drugiej liczby
            prev = d[i];
            d[i] += val_other;
            if (d[i] < prev) next_carry = 1;

            carry = next_carry;
        }
        while (d.size() > 1 && d.back() == 0) d.pop_back();
    }

    string to_binary(int n) {
        string s = "";
        BigInt temp = *this;
        for (int i = 0; i < n; i++) {
            s += (char)(temp.div_mod(2) + '0');
        }
        reverse(s.begin(), s.end());
        return s;
    }
};

int get_move_id(char c) {
    if (c == 'P') return 0;
    if (c == 'K') return 1;
    if (c == 'N') return 2;
    return -1;
}

void solve() {
    string name;
    if (!(cin >> name)) return;
    bool is_algosia = (name == "Algosia");

    int n, t_cases;
    cin >> n >> t_cases;

    while (t_cases--) {
        string my_bits;
        cin >> my_bits;

        BigInt send_val;
        send_val.from_binary(my_bits);

        BigInt recv_val;
        BigInt multiplier;
        multiplier.d[0] = 1;

        int diff = 0;
        int sent_count = 0, recv_count = 0;
        char game_chars[] = { 'P', 'K', 'N' };

        for (int r = 0; r < 20000; ++r) {
            if (sent_count >= n && recv_count >= n) break;

            char my_move;
            if (diff == 0) {
                int bit = (sent_count < n) ? send_val.div_mod(3) : 0;
                if (sent_count < n) sent_count++;
                my_move = game_chars[bit];
            }
            else if ((diff == 1 && is_algosia) || (diff == -1 && !is_algosia)) {
                my_move = 'K';
            }
            else {
                int bit = (sent_count < n) ? send_val.div_mod(2) : 1;
                if (sent_count < n) sent_count++;
                my_move = (bit == 0 ? 'K' : 'P');
            }

            cout << my_move << endl;
            cout.flush();

            char op_move;
            if (!(cin >> op_move)) break;

            int op_base = 0;
            if (diff == 0) op_base = 3;
            else if ((diff == 1 && !is_algosia) || (diff == -1 && is_algosia)) op_base = 1;
            else op_base = 2;

            if (recv_count < n) {
                if (op_base == 3) {
                    int d_val = get_move_id(op_move);
                    BigInt term = multiplier;
                    term.mul_add(d_val, 0);
                    recv_val.add(term);
                    multiplier.mul_add(3, 0);
                    recv_count++;
                }
                else if (op_base == 2) {
                    int d_val = (op_move == 'K' ? 0 : 1);
                    BigInt term = multiplier;
                    term.mul_add(d_val, 0);
                    recv_val.add(term);
                    multiplier.mul_add(2, 0);
                    recv_count++;
                }
            }

            int m1 = get_move_id(my_move);
            int m2 = get_move_id(op_move);
            if (m1 != m2) {
                bool i_win = (m1 == 0 && m2 == 1) || (m1 == 1 && m2 == 2) || (m1 == 2 && m2 == 0);
                diff += (is_algosia ? (i_win ? 1 : -1) : (i_win ? -1 : 1));
            }
        }

        cout << "! " << recv_val.to_binary(n) << endl;
        cout.flush();
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}