#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector < int >;
#define pb push_back
#define sz(x) ((int)(x).size())
#define me(a, b) memset(a, b, sizeof(a))
#define qio() cin.tie(0) -> sync_with_stdio(0)
#define L(i, j, k) for (int i = j; i <= int(k); i++)
#define R(i, j, k) for (int i = j; i >= int(k); i--)

template < class T > ostream& operator << (ostream& out, vector < T > v) {
	out << '[';  if (!v.empty()) { L(i, 0, v.size() - 2) out << v[i] << ','; out << v[v.size() - 1]; } return out << ']';
}
#define DEBUG
namespace Dbg {
	template < class T > void dbg(char *f, T t) { cerr << f << " = " << t << endl; }
	template < class T, class ...Ar > void dbg(char *f, T x, Ar... y) {
		while (*f != ',') { cerr << *f++; } cerr << " = " << x << ","; dbg(f + 1, y...);
	}
}
#ifdef DEBUG
	#define gdb(...) cerr << "gdb " << __LINE__ << ": ", Dbg::dbg((char*)#__VA_ARGS__,__VA_ARGS__)
#else
	#define gdb(...) void()
	#define debug void()
#endif

const int N = 2505;

string result;
int deg[N], fa[N], faid[N], cur[N];
bool appear[N];
map < int, int > G[N];

void solve() {
	int finish = 0, travel = 1, last = N - 1, u, lastout = 0, now = 0, rt = 0;
	bool determined = 0;
	vector < pair < int, int > > edge;

	while (finish < travel) {
		now++;
		cin >> u >> deg[u];
		G[last][u] = lastout;

		if (now == 1) {
			rt = u;
		}

		if (!appear[u]) {
			travel++;
			travel -= now == 1;
			appear[u] = 1;
		}

		if (u == fa[last] && !determined) {
//			gdb(last, G[u][last], lastout);
			faid[last] = lastout;
			lastout = G[u][last];
			last = u;
			cout << "> " /* << "Ops " */ << lastout << endl;
			continue;
		} else if (u != fa[last]) { // 上面新加了个坚定返回的判定, 这儿得注意多判断!
			if (!fa[u]) { // 再判断一下
				fa[u] = last;
			}
//			faid[u] = lastout; // 之前忘记更新这个了
//			瞎更新, 上面那行注释是胡说八道
		}

		if (last && last != N - 1) {
			edge.pb({last, u});
		}

		last = u;
		if (cur[u] == deg[u]) { // It's time to return
			finish++;
			lastout = faid[u];
//			gdb(u, faid[u]);
			determined = 1;
			if (u == rt) {
				break;
			} // 不做这个判断会输出一个 0, 我测样例居然没发现! =.=
//			cout << "Back";
		} else {
			lastout = ++cur[u];
			determined = 0;
//			cout << "Wander";
		}
		cout << "> " << lastout << endl;
	}

	for (auto &[u, v] : edge) {
		if (u > v) {
			swap(u, v);
		}
	}
	sort(edge.begin(), edge.end());
	edge.erase(unique(edge.begin(), edge.end()), edge.end());
	cout << "! ";
	for (auto [u, v] : edge) {
		cout << u << ' ' << v << ' ';
	}
	cout << endl;

	cin >> result;
	me(appear, 0);
	me(fa, 0);
	me(faid, 0);
	me(cur, 0);
	L(i, 0, travel) {
		map < int, int >().swap(G[i]);
	}
}

int main() {
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}