#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 3e3 + 10;
int id[maxn][maxn],d[maxn],mx,cnt[maxn];
vector<pair<int,int>> edge;
void init(void)
{
    for(int i=1;i<=mx;i++)
    {
        cnt[i]=0;
        d[i]=0;
        for(int j=1;j<=mx;j++)
        {
            id[i][j]=0;
        }
    }
    mx=0;
    edge.clear();
}
int walk(int i)
{
    cout<<"> "<<i<<endl;
    int v;
    cin>>v;
    mx=max(mx,v);
    cin>>d[v];
    return v;
}
void dfs(int u,int pa)
{
    for(int i=cnt[u]+1;i<=d[u];i=cnt[u]+1)
    {
        cnt[u]++;
        int v=walk(i);
        id[u][v]=i;
        if(v==pa)
        {
            walk(id[pa][u]);
        }
        else
        {
            edge.emplace_back(u,v);
            dfs(v,u);
            walk(id[v][u]);
        }
    }
}
void solve(void)
{
    init();
    int root;
    cin>>root;
    cin>>d[root];
    dfs(root,-1);
    cout<<"! ";
    for(int i=0;i<(int)edge.size();i++)
    {
        cout<<edge[i].first<<" "<<edge[i].second;
        if(i==(int)edge.size()-1)
        {
            cout<<endl;
        }
        else
        {
            cout<<" ";
        }
    }
    string s;
    cin>>s;
    assert(s=="Correct");
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}