#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ui unsigned int
#define pii pair<int, int>
#define piii pair<int, pii>
#define pb push_back
#define f first
#define s second
#define oo (1ll << 60)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int query(string str);
string guess(int n, int s) {
string str;
vector<int>countLetter(s);
int maxLetter = 0;
for(int i = 0; i < s; ++i) {
str = "";
for(int j = 0; j < n; ++j) {
str += ('a' + i);
}
countLetter[i] = query(str);
if(countLetter[i] > countLetter[maxLetter]) {
maxLetter = i;
}
}
str = "";
for(int i = 0; i < countLetter[maxLetter]; ++i) {
str += ('a' + maxLetter);
}
for(int i = 0; i < s; ++i) {
if(i == maxLetter) continue;
string add = "";
for(int j = 0; j < countLetter[i]; ++j) {
add += ('a' + i);
}
int len = str.length();
vector<int>comesAfter(len + 2);
comesAfter[0] = countLetter[i];
comesAfter[len + 1] = 0;
for(int j = 1; j <= len; ++j) {
string ask = str.substr(0, j) + add;
comesAfter[j] = query(ask) - j;
}
for(int j = 0; j <= len; ++j) {
for(int k = comesAfter[j]; k > comesAfter[j + 1]; --k) {
str.insert(str.begin() + j + countLetter[i] - k, 'a' + i);
}
}
}
return str;
}
