#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<functional>
#include<queue>
#include<unordered_map>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<bitset>
#include<iomanip>
#include<numeric>

using namespace std;

using lli = long long;
using pii = pair<lli, lli>;
const int INF = 1e9;
const lli inf = 1e18;
const int maxn = 2e5+5;
int n, d[maxn], vis[maxn];
vector<int> edge[maxn];

int see() {
	int x;
	cin>>x; cin>>d[x];
	n = max(n, x);
	return x;
}

void go(int x) {
	cout<<"> "<<x<<endl;
}

void print() {
	cout<<"! ";
	for(int i=1; i<=n; ++i) {
		for(int j : edge[i]) {
			if(i<j)	cout<<i<<' '<<j<<' ';
		}
		vis[i] = 0;
		d[i] = 0;
		edge[i].clear();
	}
	cout<<endl;
	
	n = 0;
}

void gogogo(int x) {
	while(edge[x].size()<d[x]) {
		go(edge[x].size()+1);
		edge[x].push_back(see());
		x = edge[x][edge[x].size()-1];
	}
}

void dfs(int x, int fa) {
	vis[x] = 1;
	gogogo(x);
	
	for(int i=0; i<edge[x].size(); ++i) {
		if(!vis[edge[x][i]])	go(i+1), dfs(see(), x);
	}
	
	for(int i=0; i<edge[x].size(); ++i) {
		int y = edge[x][i];
		if(y==fa)	go(i+1), see();
	}
}

void solve() {
	dfs(see(), 0);
	print();
	string p;
	cin>>p;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t=1;
	cin>>t;
	while(t--)solve();
	return 0;
}