#include "swaps.h"
#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;++i)
#define per(i,x,y) for(int i=x;i>=y;--i)
#define lon long long
#define pb emplace_back
using namespace std;
const int n7=101234;
int dir[n7],a[n7],id[n7];

void work(int n,int NN){
	dir[1]=1;
	for(int len=1;len+len<=n;len<<=1){
		rep(i,len+1,len+len)dir[i]=!dir[i-len];
	}
	for(int len=2;len<=n;len<<=1){
		for(int lenz=len;lenz>1;lenz>>=1){
			rep(i,1,n){
				int L=1+(i-1)*len,R=i*len;
				if(R>n)break;
				rep(j,1,n){
					int l=L+(j-1)*lenz,r=L-1+j*lenz,mid=(l+r)>>1;
					if(r>R)break;
					rep(k,0,r-mid-1){
						if(mid+1+k>R)break;
						if(id[l+k]<=NN&&id[mid+1+k]<=NN)schedule(id[l+k],id[mid+1+k]);
					}
				}
			}
			vector <int> now=visit();
			int cnt=0;
			rep(i,1,n){
				int L=1+(i-1)*len,R=i*len;
				if(R>n)break;
				rep(j,1,n){
					int l=L+(j-1)*lenz,r=L-1+j*lenz,mid=(l+r)>>1;
					if(r>R)break;
					rep(k,0,r-mid-1){
						if(mid+1+k>R)break;
						if(id[l+k]>NN||id[mid+1+k]>NN){
							if(a[ id[l+k] ]<a[ id[mid+1+k] ]!=dir[i])swap(id[l+k],id[mid+1+k]);
							continue;
						}
						if( now[cnt]!=dir[i] )swap(id[l+k],id[mid+1+k]);
						cnt++;
					}
				}
			}		
		}
	}
}

void solve(int n,int fw){
	rep(i,1,n)a[i]=i,id[i]=i;
	int NN=n;n=1;
	while(n<NN)n<<=1;
	rep(i,NN+1,n)a[i]=1000000,id[i]=i;
	work(n,NN);
	vector <int> ans;
	rep(i,1,NN)ans.pb(a[ id[i] ]);
	answer(ans);
	return;
}