#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

void solve(){     
     
     vector<map<int,int>> revg;
     vector<vector<int>> g;
     vector<int> visited;
     
     auto get=[&]()->array<int,2>
	  {
	       int x,y;
	       cin>>x>>y;
	       x--;
	       while(g.size()<=x){
		    g.push_back({});
		    revg.push_back({});
		    visited.push_back(0);
	       }
	       return {x,y};
	  };

     auto query=[&](int x)->array<int,2>
	  {
	       cout<<"> "<<x+1<<endl;
	       return get();
	  };

     auto answer=[&]()
	  {
	       cout<<"!";
	       for(int i=0;i<g.size();i++){
		    for(int j:g[i]){
			 if(i>=j)continue;
			 cout<<' '<<i+1<<' '<<j+1;
		    }
	       }
	       cout<<endl;
	       string s;
	       cin>>s;
	       assert(s=="Correct");
	  };
     

     auto run=[&](auto&&run,int x,int y)->void
	  {
	       if(g[x].size()==y)return;
	       auto[a,b]=query(g[x].size());
	       revg[x][a]=g[x].size();
	       g[x].push_back(a);
	       run(run,a,b);
	  };

     auto dfs=[&](auto&&dfs,int x,int q)->void
	  {
	       visited[x]=1;
	       run(run,x,q);
	       for(int y:g[x]){
		    if(visited[y])continue;
		    auto[a,b]=query(revg[x][y]);
		    assert(y==a);
		    dfs(dfs,y,b);
		    query(revg[y][x]);
	       }
	  };
     auto[a,b]=get();
     dfs(dfs,a,b);
     
     answer();
}

int main(){
     int tt=1;
     cin>>tt;
     while(tt--){
	  solve();
     }
}