#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <fstream>
#include <time.h>
#include <unordered_map>
#include <cstdlib>
#include <string.h>
#include <bitset>
#include <unordered_set>
#include <cstdlib>
#include <string.h>
#include <cassert>
#define all(a) (a).begin(), (a).end()
using namespace std;



string BASE = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
string ask(vector<int> a, int D, int B){
    string res;
    for(int i = 0; i < D; ++i){
        res += BASE[a[i]];
    }

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

    string s;
    cin >> s;
    return s;
}

void solve(int B, int D){
    int quest = int(log(B));
    vector<vector<int> > pars(D, vector<int> (2));

    for(int i = 0; i < D; ++i){
        pars[i][0] = 0;
        pars[i][1] = B;
    }

    for(int i = 0; i < quest+1; ++i){
        vector<int> a(D, 0);
        for(int j = 0; j < D; ++j){
            a[j] = (pars[j][0] + pars[j][1]) / 2;
        }

        string res = ask(a, D, B);
        if(res == "correct"){
            return;
        }

        for(int j = 0; j < D; ++j){
            if(res[j] == '-'){
                pars[j][1] = a[j];
            }

            else if(res[j] == '+'){
                pars[j][0] = a[j]+1;
            }

            else if(res[j] == '='){
                pars[j][1] = a[j];
                pars[j][0] = a[j];
            }
        }
    }

    vector<int> a;
    for(int i = 0; i < D; ++i){
        a.push_back(pars[i][0]);
    }

    string res1 = ask(a, D, B);
    if(res1 == "correct"){
        return;
    }

    cout << "cheater\n";
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int B, N;
    cin >> B >> N;
    while(N--){
        int D;
        cin >> D;
        solve(B, D);
    }
}