#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")

unsigned xrand() {
  static unsigned x = 314159265, y = 358979323, z = 846264338, w = 327950288;
  unsigned t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8;
}



void solver(int N, int X, int Y) {
  int R = xrand() % 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);
  for (int d = 1; d < N; ++d) {
    for (const int u : uss[d]) {
      int lo = 0, hi = uss[d - 1].size();
      for (; lo + 1 < hi; ) {
        const int mid = (lo + hi) / 2;
        const int res = ask(u, vector<int>(uss[d - 1].begin() + lo, uss[d - 1].begin() + mid));
        ((res == mid - lo) ? hi : lo) = mid;
      }
      answer(u, uss[d - 1][lo]);
    }
  }
}