#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

int dp[27][1001][1001];
int pi[27][1001][1001];
bool valid[27][1001][1001];

int get_dp(int rounds, int l, int n) {
    // dp: cost
    if (valid[rounds][l][n]) return dp[rounds][l][n];
    if (rounds <= 0 || l >= n) return 0;


    dp[rounds][l][n] = 1e9;
    for (int i = l + 1; i <= n; ++i) {
        int tmp = 0;

        // guess i

        // judge: < i; exactly l;
        tmp = max(tmp, i + get_dp(rounds - 1, 0, n - l));
        // judge: >= i;
        tmp = max(tmp, i + get_dp(rounds, i, n));

        dp[rounds][l][n] = min(dp[rounds][l][n], tmp);
    }

    valid[rounds][l][n] = true;
    return dp[rounds][l][n];
}

constexpr int kInf = 1'000'000'000;
vector<int> crit(int l, int n) {
    vector<int> v;
    for (int i = -5; i <= 5; i++)
        v.push_back((1 + l * 2) + i);
    for (int &x : v) {
        x = max(x, l + 1);
        x = min(x, n);
    }
    return v;
}

void solve() {
    int _n;
    cin >> _n;
    set<string> st; 
    for (int r = 26; r >= 1; r--) {
        int l = 0, n = _n - SZ(st);
        do {
            int i = pi[r][n][l]; 
            cout << "query " << (char)('a' + (r - 1)) << " " << i << endl;
            int k;
            cin >> k;
            for (int j = 0; j < k; j++) {
                string s;
                cin >> s;
                st.insert(s);
            }
            if (k < i)
                break;
            else
                l = k;
        } while (l < n);
    }
    assert(SZ(st) == _n);
    cout << "answer";
    for (auto s : st)
        cout << " " << s;
    cout << endl;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    for (int r = 1; r <= 26; ++r) {
        for (int n = 0; n <= 1000; ++n) {
            dp[r][n][n] = 0;
            for (int l = n - 1; l >= 0; --l) {
                dp[r][n][l] = kInf;
                for (int i = min(n, max(l + 1, (1 + l * 2) - 5)); i <= min(n, (1 + l * 2) + 5); i++) {
                // for (int i : crit(l, n)) {
                // for (int i = l + 1; i <= n; ++i) {
                    int x = i + max(dp[r - 1][n - l][0], dp[r][n][i]);
                    if (x < dp[r][n][l])
                        dp[r][n][l] = x, pi[r][n][l] = i;
                }
            }
        }
    }
    int T;
    cin >> T;
    while (T--)
        solve();
}