#include<bits/stdc++.h>
using namespace std;
struct edg
{
	int x,y;
	edg(int nx=0,int ny=0){x=nx;y=ny;}
	bool operator<(const edg&z)const
	{
		if(x!=z.x)return x<z.x;
		return y<z.y;
	}
};
int T,n,m;
int tot[2505];
int d[2505];
int f[2505],fp[2505],fr[2505];
int vis[2505];
int vr[2505],tt,ttt;
set<edg>st;
set<edg>::iterator it;
void init()
{
	for(int i=0;i<=n+1;i++)tot[i]=vr[i]=d[i]=f[i]=fp[i]=vis[i]=fr[i]=0;
	st.clear();	
}
void dfs(int p)
{
	if(tot[p]>=d[p])
	{
		vr[p]=1;
		if(fr[p]==0)return;
		printf("> %d\n",fr[p]);
		fflush(stdout);
		scanf("%d%d",&tt,&ttt);
		dfs(f[p]);
		return;
	}
	int v,dd;
	printf("> %d\n",++tot[p]);
	fflush(stdout);
	scanf("%d %d",&v,&dd);
	st.insert(edg(min(v,p),max(v,p)));
	if(v==f[p])
	{
		fr[p]=tot[p];
		if(tot[p]<d[p])
		{
			printf("> %d\n",fp[p]);
			fflush(stdout);
			scanf("%d%d",&tt,&ttt);
			dfs(p);
			return;
		}
		else
		{
			vr[p]=1;
			dfs(v);
			return;
		}
	}
	if(vis[v])
	{
		
		dfs(v);
		return;
	}
	vis[v]=1;
	n++;
	d[v]=dd;
	f[v]=p;
	fp[v]=tot[p];
	//ex.push_back(p);
	//ey.push_back(v);
	dfs(v);
	return;
}
char s[10];
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		n=0;//scanf("%d%d",&n,&m);
		int x,dd;
		scanf("%d%d",&x,&dd);
		d[x]=dd;
		vis[x]=1;
		n++;
		dfs(x);
		printf("!");
		//assert(st.size()==m);
		for(it=st.begin();it!=st.end();it++)printf(" %d %d",(*it).x,(*it).y);
		printf("\n");
		fflush(stdout);
		scanf("%s",s);
		//assert(s[0]=='C');
		init();
	}
	return 0;
}