#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define pll pair<ll,ll>
#define ls d*2
#define rs d*2+1
#define mid (l+r)/2
#define Umax ULLONG_MAX
#define Lmax LLONG_MAX
#define Lmin LLONG_MIN
#define lowbit(x) (x&(-x))
//#define endl "\n"
#define all(x) x.begin(),x.end()
//#define int long long
//mt19937 seed;
//uniform_int_distribution<int>num(0,2e9);
const int N=5e5+10;
const int M=33;
int a[2501],d[2501];
int vis[2501];
int to[2501][2501];
vector<int>e[2501];
vector<pii>ans;
map<pii,int>mp;
void solve(int pos){
	if(a[pos]<d[pos]){
		cout<<"> "<<++a[pos]<<endl;
		int p;
		cin>>p;
		cin>>d[p];
		to[pos][p]=a[pos];
		e[pos].push_back(p);
		ans.push_back({pos,p});
		solve(p);
	}
	else{
		vis[pos]=1;
		for(auto v:e[pos])if(!vis[v]){
			vis[v]=1;
			int p,num;
			cout<<"> "<<to[pos][v]<<endl;
			cin>>p>>num;
			solve(v);
			cout<<"> "<<to[v][pos]<<endl;
			cin>>p>>num;
		}
	}
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _=1;cin>>_;
    while(_--){
        int n;
        cin>>n;
        cin>>d[n];
        solve(n);
        cout<<"! ";
        for(int i=0;i<(int)ans.size();i++){
        	if(!mp.count({ans[i].first,ans[i].second})&&!mp.count({ans[i].second,ans[i].first})){
        		cout<<ans[i].first<<" "<<ans[i].second<<" ";
        		mp[{ans[i].first,ans[i].second}]=mp[{ans[i].second,ans[i].first}]=1;
			}
		}
		cout<<endl;
		for(int i=1;i<=2500;i++)d[i]=a[i]=vis[i]=0,e[i].clear();
		ans.clear();
		mp.clear();
		string s;
		cin>>s;
    }
}