#include<bits/stdc++.h>
#include "seq.h"
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
const int N=1e5+5;
int a[N],wz[N],b[N],dy[N],xl1[N],xl2[N];
void cz(int x,int y){
    int mc=__lg(x+y),dx=x,dy=y,d1=wz[x],d2=wz[y]; swap(a[d1],a[d2]),swap(wz[x],wz[y]);
    while(1){if(dx==y) break; else if(dx%2==0) add(d1,d2),dy+=dx/2,dx/=2; else add(d2,d1),dx+=dy/2,dy/=2;}
}
void SEQ(int n,int M){
    rep(i,1,n) a[i]=i,wz[i]=i,b[i]=Get(i);
    answer(1),dy[2]=1;
    rep(i,3,n) dy[i]=dy[i-1]+((1<<dy[i-1])+1<=i); 
    per(i,n,2){
        int d1=a[i],d2=b[i],t1=0,t2=0;
        if(d1==d2) continue;
        while(d1!=1) xl1[++t1]=d1,d1=(1<<dy[d1])+1-d1;
        while(d2!=1) xl2[++t2]=d2,d2=(1<<dy[d2])+1-d2;
        xl1[++t1]=xl2[++t2]=1;
        rep(j,1,t1-1) cz(xl1[j],xl1[j+1]);
        per(j,t2-1,1) cz(xl2[j+1],xl2[j]);
    }
}