//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KIVI
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

mt19937 rng(4242);

const int max_n = 2505, inf = 1000111222;

int cv = 0;

vector<int> g[max_n];

int deg[max_n];

int done[max_n];

int edg_num[max_n][max_n];

pair<int, int> go(int i) {
    cout << "> " << i << endl;
    int x, dx;
    cin >> x >> dx;
    return {x, dx};
}

void solve() {
    cin >> cv; cv--;
    cin >> deg[cv];
    vector<int> ord;
    int mx_node = cv;
    while(true) {
        umax(mx_node, cv);
//        cout << cv << ' ' << done[cv] << ' ' << deg[cv] << '\n';
        if(done[cv] == deg[cv]) {
            if(ord.empty()) break;
            bool bruh = false;
            map<int, int> have;
            vector<int> to_go;
            for(int i = len(ord) - 1; i >= 0; i--) {
                if(have[ord[i]] > 0) {
                    while(to_go.back() != ord[i]) {
                        have[to_go.back()]--;
                        to_go.pop_back();
                    }
                } else {
                    have[ord[i]]++;
                    to_go.pb(ord[i]);
                }
                if(done[ord[i]] != deg[ord[i]]) break;
                if(i == 0) bruh = true;
            }
            if(bruh) break;
            for(auto& x : to_go) {
                auto to = go(edg_num[cv][x]);
                cv = to.fi - 1; deg[cv] = to.se;
            }
        } else {
            done[cv]++;
            auto to = go(done[cv]);
            ord.pb(cv);
            edg_num[cv][to.fi - 1] = done[cv];
            cv = to.fi - 1; deg[cv] = to.se;
        }
    }
    cout << "! ";
    for(int i = 0; i <= mx_node; i++) {
        done[i] = 0;
        deg[i] = -1;
        for (int j = i + 1; j <= mx_node; j++) {
            if (edg_num[i][j] != -1)
                cout << i + 1 << ' ' << j + 1 << ' ';
            edg_num[i][j] = -1;
        }
    }
    cout << endl;
    string s; cin >> s;
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    for(int i = 0; i < max_n; i++)
        for(int j = 0; j < max_n; j++)
            edg_num[i][j] = -1;

    int t = 1;

    cin >> t;

    while (t--) solve();

}

/*
KIVI
*/