#include "seq.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")


constexpr int INF = 1001001001;

void SEQ(int N, int M) {
  assert(N <= 5000);
  
  vector<int> B(N + 1);
  for (int i = 1; i <= N; ++i) B[i] = Get(i);
  vector<int> ps(N + 1), qs(N + 1);
  for (int i = 1; i <= N; ++i) ps[i] = qs[i] = i;
  
  vector<int> es(2 * N + 1, 0);
  for (int m = 3; m < 2 * N; m += 2) {
    int two = 1;
    for (int e = 1; ; ++e) {
      (two *= 2) %= m;
      if (two == 1) {
        break;
      }
      if (two == m - 1) {
        es[m] = e;
        break;
      }
    }
  }
// cerr<<"es = "<<es<<endl;
  
  auto exch = [&](int i, int j) -> void {
    int a = ps[i], b = ps[j];
// cerr<<"  exch "<<i<<" "<<j<<"; "<<a<<" "<<b<<endl;
    assert(es[a + b]);
    for (; !(a == ps[j] && b == ps[i]); ) {
      if (a % 2 == 0) {
        add(i, j);
        b += a / 2;
        a -= a / 2;
      } else if (b % 2 == 0) {
        add(j, i);
        a += b / 2;
        b -= b / 2;
      } else {
        assert(false);
      }
    }
    swap(qs[ps[i]], qs[ps[j]]);
    swap(ps[i], ps[j]);
  };
  auto sw = [&](int i, int j) -> void {
    const int a = ps[i], b = ps[j];
// cerr<<"sw "<<i<<" "<<j<<"; "<<a<<" "<<b<<endl;
    if (es[a + b]) {
      exch(i, j);
      return;
    }
    if ((a + b) % 2 == 0) {
      int mn = INF;
      int cm = 0;
      for (int c = 1; c <= N; ++c) if (es[a + c] && es[b + c]) {
        if (chmin(mn, 2 * es[a + c] + es[b + c])) {
          cm = c;
        }
      }
      if (cm) {
// cerr<<"  via "<<cm<<endl;
        const int k = qs[cm];
        exch(i, k);
        exch(i, j);
        exch(j, k);
        return;
      }
    }
    if ((a + b) % 2 != 0) {
      int mn = INF;
      int cm = 0, dm = 0;
      for (int c = 1; c <= N; ++c) if (es[a + c]) {
        for (int d = 1; d <= N; ++d) if (es[b + d] && es[c + d]) {
          if (chmin(mn, es[a + c] + es[b + d] + es[c + d])) {
            cm = c;
            dm = d;
          }
        }
      }
      if (cm) {
// cerr<<"  via "<<cm<<" "<<dm<<endl;
        const int k = qs[cm], l = qs[dm];
        exch(i, k);
        exch(j, l);
        exch(i, j);
        exch(j, k);
        exch(i, l);
        return;
      }
    }
    cerr << "FAIL N = " << N << ": " << a << " " << b << endl;
    assert(false);
  };
  
  answer(1);
  vector<int> vis(N + 1, 0);
  for (int i = 1; i <= N; ++i) if (!vis[i]) {
    vector<int> cyc;
    for (int j = i; !vis[j]; j = B[j]) {
      vis[j] = 1;
      cyc.push_back(j);
    }
    for (int k = 0; k < (int)cyc.size() - 1; ++k) {
      sw(cyc[k], cyc[k + 1]);
    }
  }
}