#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 3010;

int T,n,fa[MAXN],tag[MAXN],deg[MAXN];

vector<int> e[MAXN];

void solve(){
    for(int i=1;i<=2500;i++){
        fa[i] = tag[i] = 0; 
        e[i].clear();
    }
    int pu = -1,pd = -1; n = 0;
    for(int u,d;;){
        auto walk = [&](int pos){
            cout<<"> "<<pos+1<<endl;
            pu = u,pd = pos;
        };  
        cin>>u>>d; n = max(n,u);
        e[u].resize(d,-1); deg[u] = d;
        if(pu != -1)e[pu][pd] = u;
        int pos = -1; for(int j=0;j<deg[u];j++)if(e[u][j]==-1){pos=j;break;}
        if(pos != -1){ 
            walk(pos);
            continue;
        }
        tag[u] = 1; 
        for(int j=0;j<deg[u];j++)if(!tag[e[u][j]]){pos=j;break;}
        if(pos != -1){
            fa[e[u][pos]] = u; 
            walk(pos);
            continue;
        }
        for(int j=0;j<deg[u];j++)if(e[u][j] == fa[u]){pos=j;break;}
        if(pos != -1){
            walk(pos);
            continue;
        }
        break;
    }
    cout<<"! ";
    for(int i=1;i<=n;i++)for(int j=0;j<deg[i];j++)if(i < e[i][j])cout<<i<<" "<<e[i][j]<<" "; cout<<endl;
    string str; cin>>str;
}

int main(){
    cin>>T;
    while(T--)solve();

    return 0;
}