#include <bits/stdc++.h>
#define SZ(c) ((int)(c).size())
#define ONLINE 1

using namespace std;

const int N = 1111;

typedef pair<int, int> pii;

double dp[N];
vector<int> opt_qry_sizes[N];

void build() {
  for (int U = 1; U <= 1000; ++U) {
    for (int i = 1; i <= U; ++i)
      dp[i] = 3.78 * i;
    int cur = 0, mx = 0;
    //if (U % 100 == 0)
      //printf("U=%d: ", U);
    //opt_qry_sizes[U].push_back(1);
    for (int i = 1; i <= U; ++i) {
      assert(dp[i] - cur >= 0);
      if (i >= mx) {
        if (i == U) {
          if (mx < U)
            opt_qry_sizes[U].push_back(U);
          break;
        }
        int tmp = min(int(dp[i] - cur), U);
        if (tmp < i)
          printf("fail@ U %d i %d\n", U, i);
        assert(tmp >= i);
        if (tmp > mx) {
          //if (U % 100 == 0)
            //printf(" %d", tmp);
          opt_qry_sizes[U].push_back(tmp);
          cur += tmp;
          mx = tmp;
        }
      }
    }
    //if (U % 100 == 0)
      //printf("\n");
  }
}

vector<string> groundtruth{
  "aaa",
    "aba",
    "czzzz",
    "cxyxy"
      //"zzzzz"
};

vector<string> query(char c, int k) {
  static char buf[111];
  printf("query %c %d\n", c, k);
  fflush(stdout);
  vector<string> res;

  if (ONLINE) {
    int real_k;
    scanf("%d", &real_k);
    for (int i = 0; i < real_k; ++i) {
      scanf("%s", buf);
      res.push_back(buf);
    }
  } else {
    for (auto s: groundtruth)
      if (s[0] == c)
        res.push_back(s);
  }
  return res;
}

void answer(const vector<string> &ss) {
  printf("answer");
  for (int i = 0; i < SZ(ss); ++i)
    printf(" %s", ss[i].c_str());
  printf("\n");
  fflush(stdout);
}

int n;

vector<string> ans[33];

void main2() {
  if (ONLINE) {
    scanf("%d", &n);
  } else {
    n = SZ(groundtruth);
  }
  for (int c = 0; c < 26; ++c)
    ans[c].clear();
  int remaining = n;
  for (int c = 0; c < 26; ++c) {
    ans[c] = query('a' + c, 1);
    if (SZ(ans[c]) == 0)
      continue;
    for (int guess: opt_qry_sizes[remaining]) {
      if (guess == 1)
        break;
      ans[c] = query('a' + c, guess);
      if (SZ(ans[c]) < guess || SZ(ans[c]) == remaining) {
        break;
      }
    }
    remaining -= SZ(ans[c]);
    if (remaining == 0)
      break;
  }
  vector<string> all_ans;
  for (int c = 0; c < 26; ++c)
    for (auto s: ans[c])
      all_ans.push_back(s);
  answer(all_ans);
}

int main() {
  build();
  int tc;
  if (ONLINE) {
    scanf("%d", &tc);
  } else {
    tc = 1;
  }
  while (tc--) {
    main2();
  }
}