#include <bits/stdc++.h>
using namespace std;
const int maxn=2505;
const int maxm=10005;

bool ed;
int T,n,num,po;
vector<int> G[maxn];
int d[maxn],cur[maxn],cc[maxn];
bool vis[maxn];
void End(){
    cout<<"!";
    for(int i=1;i<=n;++i){
        for(auto s:G[i]){
            if(s<i) continue;
            cout<<" "<<i<<" "<<s;
        }
    }
    cout<<endl;
    string s;
    cin>>s;
    if(s=="Wrong"){
        exit(0);
    }
}
void work(int fr){
    int pos,du;
    cin>>pos>>du;
    if(!d[pos]){
        d[pos]=du;
        n++;
    }
    if(fr) G[fr].push_back(pos);
    if(cur[pos]!=d[pos]){
        cur[pos]++;
        cout<<"> "<<cur[pos]<<endl;
        work(pos);
    }else po=pos;
}
void check(int p,int fr){
    vis[p]=1;
    if(cur[p]!=d[p]) work(0);
    for(int i=0;i<d[p];++i){
        if(!vis[G[p][i]]){
            cout<<"> "<<i+1<<endl;
            check(G[p][i],p);
        }
    }
    num++;
    for(int i=0;i<d[p];++i){
        if(G[p][i]==fr){
            cout<<"> "<<i+1<<endl;
            return ;
        }
    }
    if(n==num){
        End();
    }
}
int main(){
    cin>>T;
    while(T--){
        n=num=0;
        ed=0;
        work(0);
        check(po,0);
        for(int i=1;i<=n;++i){
            G[i].clear(); 
            d[i]=cur[i]=cc[i]=0;
            vis[i]=0;
        }
    }
    return 0;
}