#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

inline int rd() {
    int x = 0;
    bool f = 0; 
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c== '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

#define N 2507

int deg[N], fa[N];

vector<int> e[N];

unordered_set<int> son[N];

queue<int> q; 

inline void work(){
    int n = 0;
    rep(i, 1, N - 1) fa[i] = deg[i] = -1, e[i].clear(), son[i].clear();
    auto upd = [&](int x) {n = max(n, x);}; 
    auto ok = [&](int x) {return e[x].size() == deg[x] && son[x].empty();};
    auto query = [&](int x){
        printf("> %d\n", x);
        fflush(stdout);
        int tar = rd(), tardeg = rd();
        upd(tar);
        return make_pair(tar, tardeg);
    };
    int p = rd();
    deg[p] = rd();
    upd(p);
    auto check = [&](){
        rep(i, 1, n) if (!ok(i)) return true;
        return false;
    };

    while(check()) {
        int pre = p;
        if (e[p].size() < deg[p]){ //unknown son / known not son
            auto [tar, tardeg] = query(e[p].size() + 1);
            e[p].eb(tar);
            if (deg[tar] == -1) {
                deg[tar] = tardeg;
                fa[tar] = p;
                son[p].insert(tar);
            }
            p = tar;
        } else if (!son[p].empty()) {
            int tar = *son[p].begin();
            son[p].erase(tar);
            rep(i, 1, deg[p]) if (e[p][i - 1] == tar) {
                p = query(i).first; break;
            }
        } else {
            rep(i, 1, deg[p]) if (e[p][i - 1] == fa[p]) {
                p = query(i).first; break;
            }
        }
        rep(i, 1, n) if (ok(i)) q.push(i);
        while (!q.empty()) {
            int u = q.front(); q.pop();
            if (fa[u] == -1) continue;
            if (son[fa[u]].find(u) != son[fa[u]].end()) {
                son[fa[u]].erase(u);
                if (ok(fa[u])) q.push(fa[u]);
            }
        }
    }
    printf("!");
    rep(u, 1, n) for (auto v : e[u]) if (v > u) printf(" %d %d", u, v);
    puts("");
    fflush(stdout);
}

int main() {
    per(t, rd(), 1) work();
    return 0;

}