#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=2505;
int d[N],vis[N],road[N][N];
vector<int> e[N];
void dfs(int u){
	int now=(int)e[u].size()-1;
	if(now<d[u]){
		now++;int x;
		cout<<"> "<<now<<endl;
		cin>>x;cin>>d[x];
		e[u].push_back(x);
		road[u][x]=now;
		dfs(x);
		return;
	}
	vis[u]=1;
	//cerr<<"u: "<<u<<"\n";
	for(int i=1;i<=now;i++){
		if(!vis[i]){
			int v=e[u][i];
			//cerr<<"v :"<<v<<"\n";
			int x;
			cout<<"> "<<i<<endl;
			cin>>x>>d[x];
			dfs(v);
			cout<<"> "<<road[v][u]<<endl;
			cin>>x>>d[x];
		}
	}
}
void solve(){
	for(int i=1;i<N-1;i++){
		vis[i]=0;
		e[i].clear();
		e[i].push_back(0);
	}
	int u;
	cin>>u;
	cin>>d[u];
	dfs(u);
	cout<<"! ";
	for(int i=1;i<N;i++){
		for(auto v:e[i]){
			if(i<v){
				cout<<i<<" "<<v<<" ";
			}
		}
	}
	cout<<endl;
	string s;cin>>s;
}
int main(){
	
	int _=1;cin>>_;
	while(_--) solve();
	return 0;
}