#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2505;
typedef long long ll;
int a[N], b[N];
int n;
inline int get(int x)
{
	cout << "> " << x << endl;
	int p, q;
	cin >> p >> q;
	a[p] = q;
	n = max(n, p);
	return p;
}
vector<pair<int, int>> edges;
vector<int> g[N];
int mp[N][N];
bool vis[N];
inline void dfs(int u)
{
	if (b[u] < a[u])
	{
		int v = get(++b[u]);
		mp[u][v] = b[u];
		g[u].push_back(v);
		dfs(v);
		return;
	}
	vis[u] = true;
	for (int v : g[u])
	{
		if (!vis[v])
		{
			get(mp[u][v]);
			dfs(v);
			get(mp[v][u]);
		}
	}
}
inline void work()
{
	int p, q;
	cin >> p >> q;
	n = p;
	a[p] = q;
	dfs(p);
	for (int u = 1; u <= n; ++u)
		for (int v : g[u])
			if (u < v)
				edges.emplace_back(u, v);
	sort(edges.begin(), edges.end());
	edges.erase(unique(edges.begin(), edges.end()), edges.end());
	cout << '!';
	for (auto i : edges)
	{
		cout << ' ' << i.first << ' ' << i.second;
		mp[i.first][i.second] = mp[i.second][i.first] = 0;
	}
	cout << endl;
	for (int i = 1; i <= n; ++i)
	{
		b[i] = 0;
		vis[i] = 0;
		g[i].clear();
	}
	edges.clear();
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while (T--)
		work();
	return 0;
}