#include <bits/stdc++.h>
using namespace std;

using ll = long long;
//#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

struct IO
{
    pii get()
    {
        int x,d;
        cin>>x>>d;
        return {x-1,d};
    }
    void walk(int i)
    {
        cout<<"> "<<i+1<<endl;
    }
    void answer(const vector<vi>& g)
    {
        cout<<"! ";
        for(int i=0;i<sz(g);i++)
            for(int j:g[i])
                if(i<j)
                    cout<<i+1<<" "<<j+1<<" ";
        cout<<endl;
        string resp;
        cin>>resp;
        if(resp!="Correct")
            exit(0);
    }
} io;

mt19937 rng;

void solve(auto&interactor)
{
    vector<vi> g;
    auto[x,d]=interactor.get();
    while(true)
    {
        if(sz(g)<=x)
            g.resize(x+1);
        g[x].resize(d,-1);
        vector<int> unknown;
        for(int i=0;i<d;i++)
            if(g[x][i]==-1)
                unknown.pb(i);
        if(!unknown.empty())
        {
            int i=unknown[rng()%sz(unknown)];
            interactor.walk(i);
            auto[xx,dd]=interactor.get();
            g[x][i]=xx;
            tie(x,d)=pair(xx,dd);
        }
        else
        {
            queue<int> q;
            vector<int> ind(sz(g),-1);
            ind[x]=-2;
            for(int i=0;i<sz(g[x]);i++)
                q.push(g[x][i]),
                ind[g[x][i]]=i;
            int where=-1;
            while(!q.empty()&&where==-1)
            {
                int v=q.front();
                q.pop();
                for(int to:g[v])
                    if(to==-1)
                    {
                        where=ind[v];
                        break;
                    }
                    else if(ind[to]==-1)
                    {
                        ind[to]=ind[v];
                        q.push(to);
                    }
            }
            if(where==-1)
                break;
            interactor.walk(where);
            tie(x,d)=interactor.get();
        }
    }
    interactor.answer(g);
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t;
    cin>>t;
    while(t--)
        solve(io);
}