#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  std::vector<std::vector<int>> g(2501);

  const auto receive = [&]() -> int {
    int x, d;
    scan(x, d);
    if (g[x].empty()) {
      g[x].assign(d, -1);
    } else {
      assert(len(g[x]) == d);
    }
    return x;
  };

  const auto greedy = [&](int start) {
    int x = start;
    while (true) {
      const int i = static_cast<int>(ranges::find(g[x], -1) - g[x].begin());
      if (i == len(g[x])) {
        assert(x == start);
        return;
      }
      print('>', i + 1);
      g[x][i] = receive();
      x = g[x][i];
    }
  };

  const int start = receive();

  std::vector<bool> visited(2501);
  visited[start] = true;
  fix([&](auto self, int x) -> void {
    greedy(x);
    for (const int i : rep(len(g[x]))) {
      const int y = g[x][i];
      if (!visited[y]) {
        visited[y] = true;
        print('>', i + 1);
        receive();
        self(y);
        const int j = static_cast<int>(ranges::find(g[y], x) - g[y].begin());
        print('>', j + 1);
        receive();
      }
    }
  })(start);

  std::vector<std::pair<int, int>> ans;
  for (const int i : rep(2501)) {
    for (const int j : g[i]) {
      if (i < j) {
        ans.emplace_back(i, j);
      }
    }
  }
  print('!', ans);
  std::string res;
  scan(res);
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cout << std::setprecision(DBL_DECIMAL_DIG);

  int t;
  scan(t);
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#define len(...) static_cast<int>(ranges::size(__VA_ARGS__))

#endif  // __INCLUDE_LEVEL__