#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
#define SZ(a) (int(a.size()))

typedef long long ll;
typedef double db;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
std::mt19937_64 gen(std::chrono::system_clock::now().time_since_epoch().count());
ll get(ll l, ll r) { std::uniform_int_distribution<ll> dist(l, r); return dist(gen); }

constexpr int N = 3000;

int d[N], fa[N], fae[N], onTree[N], n, now[N];
map<int, int> son[N];
int read() {
    int x;
    cin >> x;
    cin >> d[x];
    n = max(n, x);
    return x;
}
void go(int x) {
    cout << "> " << x << endl;
}
void solve() {
    set<pii> ans;
    int x = read(), y;
    onTree[x] = 1;
    while(1) {
        if(now[x] < d[x]) {
            now[x]++;
            go(now[x]);
            y = read();
            ans.insert(minmax(x, y));
            if(y == fa[x]) { // go back
                fae[x] = now[x];
                go(son[y][x]);
                y = read();
                assert(x == y);
            } else if(!onTree[y]) {
                onTree[y] = 1;
                fa[y] = x;
                son[x][y] = now[x];
            }
        } else {
            if(x == 1) break;
            go(fae[x]);
            y = read();
            assert(y == fa[x]);
        }
        x = y;
    }
    cout << "!";
    for(auto [i, j] : ans)
        cout << " " << i << " " << j;
    cout << endl;
    string s;
    cin >> s;
    assert(s == "Correct");
    for(int i = 1; i <= n; i++) {
        d[i] = fa[i] = fae[i] = onTree[i] = now[i] = 0;
        son[i].clear();
    }
    n = 0;
}
signed main() {
    atexit([](){cerr << "time: " << (db)clock()/CLOCKS_PER_SEC << "s\n";});
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}