// 

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define debug(...) void(0)
#endif
typedef long long LL;
int deg[3010];
namespace interacter {
int getpos() {
  int now;
  cin >> now;
  cin >> deg[now];
  return now;
}
void walk(int i) {
  cout << ">"
       << " " << i << endl;
}
};  // namespace interacter
namespace judger {
vector<int> g[3010];
int you;
mt19937 rng{random_device{}()};
void init() {
  int n = 5;
  for (int i = 1; i <= n; i++) g[i].clear();
  you = rng() % n + 1;
  for (int i = 2; i <= n; i++) {
    int f = rng() % (i - 1) + 1;
    g[f].push_back(i), g[i].push_back(f);
  }
  int m = rng() % (n / 2);
  for (int i = 1; i <= m; i++) {
    int u = rng() % n + 1, v = rng() % n + 1;
    while (u == v || find(g[u].begin(), g[u].end(), v) != g[u].end()) {
      u = rng() % n + 1, v = rng() % n + 1;
    }
    g[u].push_back(v);
    g[v].push_back(u);
  }
  debug(": ");
  for (int i = 1; i <= n; i++)
    for (int v : g[i])
      if (v > i) debug("%d %d ", i, v);
  debug("\n");
}
void test() {
  g[1] = {2, 3, 5};
  g[2] = {1, 4};
  g[3] = {1, 5};
  g[4] = {2};
  g[5] = {1, 3};
  you = 1;
}
void walk(int i) {
//debug("walk: now = %d, i = %d\n", you, i);
  you = g[you][i - 1];
}
int getpos() {
//debug("getpos: now = %d, deg = %d\n", you, (int)g[you].size());
  deg[you] = g[you].size();
  return you;
}
};  // namespace judger
#ifndef LOCAL
using interacter::getpos;
using interacter::walk;
#else
using judger::getpos;
using judger::walk;
#endif
int n, m, fa[3010];
basic_string<int> g[3010];
int now;
int mian() {
#ifdef LOCAL
  judger::init();
//judger::test();
#endif
  memset(fa, -1, sizeof fa);
  int st = now = getpos(), maxd = st;
  g[st].clear();
  fa[st] = 0;
  while (now) {
    int u = now;
    if (g[u].size() == deg[u]) {
      if (u == st) break;
      walk(find(g[u].begin(), g[u].end(), fa[u]) - g[u].begin() + 1);
      now = getpos();
    } else {
      walk(g[u].size() + 1);
      int v = now = getpos();
      g[u] += v;
      if (fa[v] == -1)
        fa[v] = u, g[v].clear(), maxd = max(maxd, v);
      else if (v == fa[u]) {
        walk(find(g[v].begin(), g[v].end(), u) - g[v].begin() + 1);
        now = getpos();
      }
    }
  }
  cout << "!"
       << " ";
  for (int i = 1; i <= maxd; i++)
    for (int v : g[i])
      if (v > i) cout << i << " " << v << " ";
  cout << endl;
#ifndef LOCAL
  string stat;
  cin >> stat;
  if (stat != "Correct") cout << ":(" << endl, exit(0);
#endif
  return 0;
}
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  int t;
  cin >> t;
  while (t--) mian();
  return 0;
}