#include<bits/stdc++.h>
using namespace std;
const int maxn=2500;
/*
vector<vector<int>> G0={{}};
vector<pair<int,int>> ansedges;
void addedge(int u,int v)
{
	while((int)G0.size()<=max(u,v))G0.emplace_back(vector<int>({}));
	G0[u].push_back(v);
	G0[v].push_back(u);
	if(u>v)swap(u,v);
	ansedges.emplace_back(u,v);
}
*/
int main()
{
	ios_base::sync_with_stdio(false);
	/*
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		addedge(u,v);
	}
	sort(ansedges.begin(),ansedges.end());
	mt19937 rng(58);
	for(int i=1;i<=n;i++)random_shuffle(G0[i].begin(),G0[i].end(),[&](int x){return rng()%x;});
	*/
	int TT;
	cin>>TT;
	while(TT--)
	{
//		int totcnt=0;
		int now,deg;
		cin>>now>>deg;
//		now=1;deg=(int)G0[1].size();
		int curroot=now;
		vector<int> d(maxn+5),cur(maxn+5),curT(maxn+5);
		d[now]=deg;
		map<pair<int,int>,int> index;
		vector<int> intree(maxn+5),vis(maxn+5),pa(maxn+5),paid(maxn+5);
		vector<vector<int>> G(maxn+5);
		vector<vector<pair<int,int>>> T(maxn+5);
		vector<pair<int,int>> edges;
		auto walk=[&](int y,int upd=0)
		{
//			cerr<<"walk "<<y<<' '<<d[y]<<' '<<upd<<endl;
//			totcnt++;
//			assert(totcnt<=2*m+2*n);
			cout<<"> "<<y<<endl;
			int newnow,newdeg;
//			newnow=G0[now][y-1];newdeg=(int)G0[newnow].size();
			cin>>newnow>>newdeg;
//			cerr<<newnow<<' '<<newdeg<<endl;
			if(upd)
			{
				G[now].push_back(newnow);
				if(now<newnow)edges.emplace_back(now,newnow);
				else edges.emplace_back(newnow,now);
				index[make_pair(now,newnow)]=G[now].size();
			}
			now=newnow;deg=newdeg;
			d[now]=deg;
		};
		int ok=0;
		while(not ok)
		{
			while(now!=curroot or d[now]!=cur[now])
			{
				walk(++cur[now],1);
			}
//			cerr<<"go tree "<<now<<endl;
			//build tree
			function<void(int)> dfs=[&](int u)
			{
				intree[u]=1;
				if(d[u]!=cur[u])return;
				//for(auto v:G[u])
				for(int i=0;i<(int)G[u].size();i++)
				{
					int v=G[u][i];
					if(intree[v])continue;
//					cerr<<"addedge "<<u<<' '<<v<<endl;
					pa[v]=u;
					paid[v]=index[make_pair(v,u)];
					/*
					for(int j=0;j<(int)G[v].size();j++)
					{
						if(G[v][j]==u)paid[v]=j+1;
					}
					*/
					T[u].emplace_back(v,i+1);
					intree[v]=1;
//					dfs(v);
				}
			};
			
			
			
			while(d[now]==cur[now])
			{
				if(not vis[now])dfs(now);
				vis[now]=1;
				/*
				int sw=0;
				for(auto [v,id]:T[now])
				{
					if(pa[now]==v or vis[v])continue;
					walk(id);
					curroot=now;
					sw=1;
					break;
				}
				*/
				if(curT[now]==(int)T[now].size())
				{
					if(pa[now]==0)
					{
						ok=1;
						break;
					}
					walk(paid[now]);
					curroot=now;
				}
				else
				{
					auto [v,id]=T[now][curT[now]];
					curT[now]++;
					walk(id);
					curroot=now;
				}
			}
		}
		sort(edges.begin(),edges.end());
		edges.resize(unique(edges.begin(),edges.end())-edges.begin());
		cout<<"!";
		for(auto [u,v]:edges)
		{
			cout<<' '<<u<<' '<<v;
		}
		cout<<endl;
//		assert(edges==ansedges);
		string verdict;
		cin>>verdict;
		if(verdict=="Correct")continue;
		break;
	}
	
	return 0;
}