#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <stack>
#include <ctime>
#include <cstdlib>
#include <cstdio>
#include <iomanip>
#include <climits>
#include <random>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define lowbit(x) (x&-x)
#define ls k<<1
#define rs (k<<1)|1
#define mid ((l+r)>>1)
#define all(x) s.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define LYLNB ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef unsigned long long u64;
//#define int long long 
const int N = 2501;
int s, id[N][N], d[N], vis[N];
vector<int>e[N];
int ask(int i) {
    printf("> %d\n", i); fflush(stdout);
    scanf("%d", &i); scanf("%d", &d[i]);
    return i;
}
void dfs(int u) {
    if ((int)e[u].size() < d[u]) {
        int i = e[u].size() + 1;
        int v = ask(i);
        e[u].push_back(v); id[u][v] = i;
        dfs(v);
        return;
    }
    vis[u] = 1;
    int i = 0;
    for (auto v : e[u]) {
        i++;
        if (!vis[v]) {
            ask(i);
            dfs(v);
            ask(id[v][u]);
        }
    }
}
void solve() {
    memset(id, 0, sizeof id);
    memset(d, 0, sizeof d);
    memset(vis, 0, sizeof vis);
    for (int i = 1; i < N; i++)e[i].clear();
    scanf("%d", &s); scanf("%d", &d[s]);
    dfs(s);
    printf("!");
    for (int i = 1; i < N; i++) {
        for (auto j : e[i]) {
            if (i < j)printf(" %d %d", i, j);
        }
    }printf("\n"); fflush(stdout);
    getchar(); char tmp[10]; scanf("%s", &tmp);
}
signed main() {
    //LYLNB;
    int T = 1; scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}