#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
constexpr int mod = 998244353;

constexpr int N = 2510;
vector<int> edge[N];
int n, deg[N], cur[N], vis[N], adj[N][N];
int move(int id) {
    cout << "> " << id << endl;
    int x; cin >> x >> deg[x];
    return x;
}
void dfs(int u, int fa) {
    if (!vis[u]) n++;
    vis[u] = true;
    for (int &i = cur[u]; i < deg[u];) {
        int v = move(++i);
        edge[u].push_back(v);
        adj[u][v] = i;
        if (adj[v][u]) {
            move(adj[v][u]);
        } else {
            dfs(v, u);
        }
    }
    for (int j = 0; j < (int)edge[u].size(); j++) {
        if (edge[u][j] == fa) move(j + 1);
    }
}
void solve() {
    int root; cin >> root >> deg[1];
    dfs(1, 0);
    cout << "!";
    for (int i = 1; i <= n; i++) {
        for (auto j : edge[i]) {
            if (i < j) cout << ' ' << i << ' ' << j;
        }
    }
    cout << endl;
    string Correct; cin >> Correct;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) adj[i][j] = 0;
        deg[i] = cur[i] = vis[i] = 0;
        edge[i].clear();
    }
    n = 0;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tt = 1;
    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}