#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define F first
#define S second
#define RE register
#define random(x) (rand() % (x))
#define LOG(a, b) (log(a) / log(b))
#define N 3005
#define mod 998244353
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3fll
int n=1,m=0,d[N],a[N][N],cr[N];
vector<int> g[N];
inline void pnt(int i){
	printf("> %d\n",i);
	fflush(stdout);
	/*
	printf("n=%d\n",n);
	for(int i=1;i<=10;++i){
		if(d[i]==0) continue;
		printf("%d %d %d:",i,cr[i],d[i]);
		for(int j=1;j<=10;++j){
			printf("%d ",a[i][j]);
		}puts("");
	}
	*/
}
int dfs1(int u){
	int v,w;
	while(cr[u]<d[u]){
		++cr[u];pnt(cr[u]);
		scanf("%d%d",&v,&w);
		a[u][v]=cr[u];
		if(d[v]==0){
			++n;
			g[u].push_back(v);
			d[v]=w;
		}
		if(dfs1(v)) return 1;
	}
	return 1;
}
void dfs2(int u){
	int t,w;
	dfs1(u);
	//printf("dfs2 at %d\n",u);
	//fflush(stdout);
	for(auto v:g[u]){
		pnt(a[u][v]);
		scanf("%d%d",&t,&w);
		dfs2(v);
		pnt(a[v][u]);
		scanf("%d%d",&t,&w);
	}
}
char s_cor[N];
int main(){
	int T,u,v;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&u,&v);d[u]=v;
		dfs2(u);
		/*
		for(int i=1;i<=10;++i){
			printf("%d:",i);
			for(auto v:g[i]) printf("%d ",v);
			puts("");
		}
		*/
		printf("!");
		for(int i=1;i<=n;++i){
			for(int j=i+1;j<=n;++j){
				if(a[i][j]){
					printf(" %d %d",i,j);
				}
			}
		}
		puts("");
		fflush(stdout);
		scanf("%s",s_cor);
		for(int i=1;i<=n;++i){
			g[i].clear();d[i]=0;cr[i]=0;
			for(int j=1;j<=n;++j) a[i][j]=0;
		}
		n=1;
	}
	return 0;
}