#include <bits/stdc++.h>

using namespace std;

const int N=5010;

typedef long long ll;

vector<int> e[N];
int d[N];
bool st[N];
int fa[N],up[N],down[N];

void solve()
{
    int x,dx,nx,ndx;
    st[1]=1;
    cin >> x >> dx;
    int maxv=1;
    while(x!=0)
    {
        maxv=max(maxv,x);
        if(dx==e[x].size())
        {
            if(x==1) x=0;
            else
            {
                cout << "> " << up[x] << "\n";
                cout.flush();
                cin >> x >> dx;
            }
        }
        else
        {
            d[x]++;
            cout << "> " << d[x] << "\n";
            cout.flush();
            cin >> nx >> ndx;
            e[x].push_back(nx);
            if(!st[nx])
            {
                st[nx]=1;
                fa[nx]=x;
                down[nx]=d[x];
                x=nx,dx=ndx;
            }
            else
            {
                if(nx==fa[x])
                {
                    up[x]=d[x];
                    cout << "> " << down[x] << "\n";
                    cout.flush();
                    cin >> x >> dx;
                }
                else x=nx,dx=ndx;
            }
        }
    }
    int n=maxv;
    vector<pair<int,int>> edge;
    for(int i=1;i<=n;i++)
    {
        for(auto x : e[i])
        {
            if(x>i) edge.push_back({i,x});
        }
    }
    for(int i=1;i<=n;i++) e[i].clear(),d[i]=0;
    for(int i=1;i<=n;i++) st[i]=0,fa[i]=0;
    cout << "! ";
    for(auto [x,y] : edge) cout << x << " " << y << " ";
    cout << "\n";
    cout.flush();
    string s;
    cin >> s;
}

int main()
{
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while(T--) solve();
    return 0;
}