#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;

//const int MN = 2e5 + 20;
const int INF = 2e9 + 1000;
const LL INFLL = 8e18 + 1000;
mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());
//模板区域~~~~~~~

//模板结束~~~~~~~

void solve() {
    V<int> a{1, 3, 7, 16, 34, 69, 133, 243, 418, 665, 939, 1041};
    int n; cin >> n;
    set<string> ans;

    auto query = [&](char c, int x) -> int {
        x = min(x, n);
        cout << "query " << c << " " << x << endl;
        int k; cin >> k;
        for(int i = 1; i <= k; i++) {
            string s; cin >> s;
            ans.insert(s);
        }
        return k;
    };

    for(char x = 'a'; x <= 'z'; x++) {
        for(int i = 0; ; i++) {
            int now = a[i];
            int t = query(x, now);
            if(t < now) break;
        }
    }
    cout << "answer ";
    for(auto s : ans) cout << s << " ";
    cout << endl;

    
}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) 
    solve();
}