#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2000005
#define MM 5005
#define MOD 1000000007

ll B;
map<char,ll> m;
map<ll,char> mm;

void solve() {

    ll n;
    cin >> n;
    ll minVal[n], maxVal[n], my_guess[n];
    bool solved[n];
    for(ll i = 0;i<n;i++){
        minVal[i] = 0;
        maxVal[i] = B-1;
        solved[i] = 0;
    }

    ll numGuess = (ll)(log2(B)) + 2;
    for(ll i=0;i<numGuess;i++) {
        string guess = "", response;
        for(ll j=0;j<n;j++) {
            my_guess[j] = (maxVal[j] + minVal[j])/2;
            guess += mm[my_guess[j]];
        }
        cout << guess << '\n';
        cout.flush();
        cin >> response;

        if(response == "correct") {
            break;
        }

        bool ok = 1;
        ll solvedCount = 0;

        for(ll j=0;j<n;j++) {
            if(response[j] == '-') {
                maxVal[j] = my_guess[j] - 1;
                if(solved[j]) ok = 0;
            }
            else if(response[j] == '+') {
                minVal[j] = my_guess[j] + 1;
                if(solved[j]) ok = 0;
            }
            else {
                solved[j] = 1;
                minVal[j] = my_guess[j];
                maxVal[j] = my_guess[j];
                solvedCount++;
            }

            if(maxVal[j] < minVal[j]) ok = 0;
        }

        if(solvedCount == n) ok = 0;

        if(!ok) {
            cout << "cheater\n";
            cout.flush();
            cin >> response;
            break;
        }
    }

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    ll t;
    cin >> B >> t;

    for(ll i=0;i<min(10ll,B);i++) {
        mm[i] = (char)(i + '0');
    }

    for(ll i=10;i<min(36ll,B);i++) {
        mm[i] = (char)(i-10 + 'A');
    }

    for(ll i=36;i<min(62ll,B);i++) {
        mm[i] = (char)(i-36 + 'a');
    }

    for(auto x : mm) {
        m[x.V] = x.K;
    }

    while(t--)
        solve();

    return 0;

}