#include <bits/stdc++.h>
#define bit(x) (1LL << (x))
#define lowbit(x) (x & (-x))
#define SQU(x) ((x) * (x))
#define ls id << 1
#define rs id << 1 | 1
//#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int inv2 = (mod + 1) / 2;
ll qpow(ll x,ll y) {
    ll res = 1;
    while(y) {
        if(y & 1) res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return res;
}
void add(int &x,int y) {
    x += y;
    if(x >= mod) x -= mod;
}
const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};

void solve() {
    int u,x;
    cin >> u >> x;
    vector <int> vtex,deg,vis,cnt;
    map <int,int> mp;
    vector <map <int,int>> g,pos;
    vector <vector <int>> tr;
    auto create_point = [&] (int u,int x) {
        deg.push_back(x);
        vtex.push_back(u);
        cnt.push_back(0);
        mp[u] = vtex.size() - 1;
        pos.push_back(map <int,int>());
        g.push_back(map <int,int>());
        tr.push_back(vector <int>());
        vis.push_back(0);
    };
    create_point(u,x);
    auto ask = [&](int v) {
        cout << "> " << v << endl;
        int res,d;
        cin >> res >> d;
        return make_pair(res,d);
    };
    set <pair <int,int>> st;

    auto dfs = [&] (auto &&self,int u,int fa) -> void {
        int now = u;
        while (true) {
            now = mp[now];
            if (cnt[now] == deg[now]) break;
            ++cnt[now];
            auto [v, d] = ask(cnt[now]);
            if (!mp.count(v)) {
                tr[now].push_back(v);
                create_point(v, d);
            }
            g[now][cnt[now]] = v;
            pos[now][v] = cnt[now];
            st.insert({min(vtex[now],v),max(vtex[now],v)});
            now = v;
        }
        //cout << tr[mp[u]].size() << endl;
        for(int i = 0;i < (int)tr[mp[u]].size();i++) {
            int son = tr[mp[u]][i];
            ask(pos[mp[u]][son]);
            self(self, son,u);
        }
//        cout << u <<' ' << fa << endl;
        if(fa!= -1) ask(pos[mp[u]][fa]);
    };

    dfs(dfs,u,-1);
    cout << "!" ;
    for(auto [u,v] : st) cout << " " << u << " " << v;
    cout << endl;
    string s;cin >> s;
}

int main(){
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}
/*
*/