#include "seq.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair <int, int>
#define mp make_pair
vector <pii> Ans;
int a[100005], pos[100005], nd[100005], b[100005];
vector <int> V; 
void get_path(int x) {
	V.clear();
	V.push_back(x);
	while(x > 1) {
		int y = 2;
		while(y < x) y *= 2;
		x = y + 1 - x;
		V.push_back(x);
	}
}
void Swap(int x, int y) {
	int A = x, B = y;
	while(B != x) {
		if(!(A & 1)) Ans.push_back(mp(pos[x], pos[y])), B += A / 2, A /= 2;
		else Ans.push_back(mp(pos[y], pos[x])), A += B / 2, B /= 2; 
	}
	swap(b[pos[x]], b[pos[y]]);
	swap(pos[x], pos[y]);
}
void SEQ(int n, int M) {
	for(int i = 1; i <= n; i++) a[i] = Get(i), nd[a[i]] = i, b[i] = pos[i] = i;
	for(int i = n; i >= 1; i--) {
		if(a[pos[i]] != i) {
			get_path(b[nd[i]]);
			int lst = 0;
			for(auto j : V) {
				if(!lst) lst = j;
				else Swap(lst, j), lst = j;
			} 
			get_path(i);
			reverse(V.begin(), V.end());
			lst = 0;
			for(auto j : V) {
				if(!lst) lst = j;
				else Swap(lst, j), lst = j;
			} 
		}
	}
	answer(1);
	for(auto x : Ans) add(x.first, x.second);
}