#include <bits/stdc++.h>
#include "Memory2_lib.h"

using namespace std;
using pii = pair<int, int>;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define len(x) (int)x.size()

vector<vector<int>> cache;
int n;

int myFlip(int a, int b)
{
  if (a > b)
    swap(a, b);
  if (a == b)
  {
    cerr << "źle";
    exit(true);
  }
  if (cache[a][b] == 0)
  {
    cache[a][b] = Flip(a, b) + 1;
    return cache[a][b] - 1;
  }
  return cache[a][b] - 1;
}

mt19937 ran(2137);

void subsolve(vector<int> div)
{
  // shuffle(all(div), ran);
  // for (int i = 0; i < len(div); i++)
  //   cout << div[i] << " ";
  // cout << "\n";
  if (len(div) == 2)
  {
    Answer(div[0], div[1], myFlip(div[0], div[1]));
    return;
  }

  vector<vector<int>> w(n);
  for (int i = 1; i < len(div); i++)
  {
    w[myFlip(div[0], div[i])].push_back(div[i]);
    // cout << A[div[0]] << " " << A[div[i]] << " ";
    // cout << P[A[div[0]]] << " " << P[A[div[i]]] << " ";
    // cout << div[0] << " " << div[i] << " ";
    // cout << myFlip(div[0], div[i]) << " ";
  }
  // cout << "\n";
  vector<int> p1;
  for (int i = 0; i < n; i++)
  {
    if (len(w[i]) && len(w[i]) != 2)
    {
      p1 = w[i];
      p1.push_back(div[0]);
    }
    else if (len(w[i]))
    {
      Answer(w[i][0], w[i][1], i);
    }
  }
  // cout << most << "\n";
  if (len(p1))
    subsolve(p1);
}

void Solve(int p_T, int p_N)
{
  n = p_N;
  cache.assign(p_N << 1, vector<int>(p_N << 1));
  vector<int> a;
  for (int i = 0; i < p_N << 1; i++)
  {
    a.push_back(i);
  }
  subsolve(a);
}

/*
1 3 10000
0 1 2
1 0 2 0 1 2

*/