//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define X first
#define Y second


const ll mod = 1000000007;
//const ll mod = 998244353;


vector<vector<int>> g;
vector<int> sz, was;
int n;


void ask(int x)
{
    cout << "> " << x+1 << endl;
}

void dfs(int p)
{
    int u, S;
    cin >> u >> S;
    if (p>0 and sz[p]>g[p].size())
    {
        g[p].push_back(u);
    }
    while (n<u)
    {
        sz.push_back(0);
        was.push_back(0);
        g.push_back({});
        n++;
    }
    sz[u] = S;
    if (sz[u]>g[u].size())
    {
        ask(g[u].size());
        dfs(u);
        return;
    }
    was[u] = 1;
    for (int i=0;i<g[u].size();i++)
    {
        int v = g[u][i];
        if (was[v]==1) continue;
        ask(i);
        dfs(u);
        for (int j=0;j<g[v].size();j++)
        {
            if (g[v][j]==u)
            {
                ask(j);
                cin >> u >> S;
                break;
            }
        }
    }


}

void solve()
{
    sz.clear();
    was.clear();
    g.clear();
    n = -1;
    dfs(0);
    vector<pair<int,int>> e;
    for (int i=1;i<=n;i++)
    {
        for (int v: g[i])
        {
            if (v>i) e.push_back({i,v});
        }
    }
    cout << "!";
    for (int i=0;i<e.size();i++) cout << " " << e[i].X << " " << e[i].Y;
    cout << endl;
    string s;
    cin >> s;
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll T;
    T = 1;
    cin >> T;
    while (T--) solve();
}