#include "tree.h"

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

#include <random>


void solver(int N, int, int) {
  mt19937_64 rng(60);
  int R = rng() % N + 1;
  vector<int> dep(N + 1, 0);
  for (int u = 1; u <= N; ++u) if (R != u) dep[u] = ask(R, {u});
  vector<vector<int>> uss(N);
  for (int u = 1; u <= N; ++u) uss[dep[u]].push_back(u);
// cerr<<"R = "<<R<<", dep = "<<dep<<", uss = "<<uss<<endl;
  vector<vector<int>> graph(N + 1);
  vector<int> par(N + 1, 0);
  vector<int> sz(N + 1, 0);
  vector<int> us{R};
  auto ae = [&](int u, int v) -> void {
    graph[u].push_back(v);
    par[v] = u;
    us.push_back(v);
    answer(u, v);
  };
  for (int d = 1; d < N; ++d) {
    for (const int t : uss[d]) {
// cerr<<COLOR("33")<<"t = "<<t<<COLOR()<<endl;
      for (const int u : us) {
        sz[u] = 1;
      }
      for (int j = (int)us.size(); --j >= 1; ) {
        const int u = us[j];
        sz[par[u]] += sz[u];
      }
      for (const int u : us) {
        shuffle(graph[u].begin(), graph[u].end(), rng);
        for (int j = 0; j < (int)graph[u].size(); ++j) {
          if (sz[graph[u][0]] < sz[graph[u][j]]) {
            swap(graph[u][0], graph[u][j]);
          }
        }
      }
// cerr<<"  us = "<<us<<", graph = "<<graph<<endl;
      // invariant: attach below u
      for (int u = R; ; ) {
        vector<int> heavy;
        for (int v = u; ; ) {
          heavy.push_back(v);
          if (!graph[v].size()) break;
          v = graph[v][0];
        }
        const int len = (int)heavy.size() - 1;
        {
          const int res = (len == 0) ? (dep[t] - dep[u]) : ask(t, {heavy[len]});
          assert((len + (dep[t] - dep[u]) + res) % 2 == 0);
          u = heavy[(len + (dep[t] - dep[u]) - res) / 2];
        }
        if (dep[t] - dep[u] == 1) {
          ae(u, t);
          break;
        }
        // light
        int lo = 1, hi = graph[u].size();
        assert(lo < hi);
        for (; lo + 1 < hi; ) {
          const int mid = (lo + hi) / 2;
          const int res = ask(t, vector<int>(graph[u].begin() + lo, graph[u].begin() + mid));
          ((res < (mid - lo) * (dep[t] - dep[u] + 1)) ? hi : lo) = mid;
        }
        u = graph[u][lo];
      }
    }
  }
}