#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
typedef long long ll;

typedef unsigned long long ull;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    vector<int> init;
    vector<vector<int>> unused;
    vector<vector<int>> ed;
    vector<int> vis;
    auto initialize = [&](int u, int d) {
      while (init.size() <= u) {
        init.push_back(0);
        unused.push_back({});
        ed.push_back({});
        vis.push_back(0);
      }
      if (init[u]) {
        return;
      }
      init[u] = 1;
      ed[u].resize(d);
      unused[u].resize(d);
      iota(unused[u].begin(), unused[u].end(), 0);
    };
    int r, d;
    cin >> r >> d;
    --r;
    initialize(r, d);
    function<void(int, int)> dfs = [&](int u, int par) {
      // cout << "start " << u + 1 << endl;
      vis[u] = 1;
      int cur = u;
      while (!unused[cur].empty()) {
        // cout << "in cycle " << cur + 1 << ' ' << unused[cur].size() << endl;
        int dir = unused[cur].back();
        unused[cur].pop_back();
        cout << "> " << dir + 1 << endl;
        int x, d;
        cin >> x >> d;
        --x;
        initialize(x, d);
        ed[cur][dir] = x;
        cur = x;
      }
      assert(cur == u);
      for (int i = 0; i < (int)ed[u].size(); ++i) {
        int v = ed[u][i];
        if (!vis[v]) {
          // cout << "lol " << u + 1 << ' ' << ed[u].size() << endl;
          cout << "> " << i + 1 << endl;
          int x, d;
          cin >> x >> d;
          --x;
          assert(x == v);
          dfs(v, u);
        }
      }
      if (par != -1) {
        for (int i = 0; i < (int)ed[u].size(); ++i) {
          if (ed[u][i] == par) {
            cout << "> " << i + 1 << endl;
            int x, d;
            cin >> x >> d;
            --x;
            assert(x == par);
          }
        }
      }
    };
    dfs(r, -1);
    cout << "! ";
    for (int i = 0; i < (int)ed.size(); ++i) {
      for (int j : ed[i]) {
        if (i < j) {
          cout << i + 1 << ' ' << j + 1 << ' ';
        }
      }
    }
    cout << endl;
    string answer;
    cin >> answer;
  }
}