#include <bits/stdc++.h>
#include "swaps.h"
using namespace std;
int p[550] , f[550] , t , N;
vector< int > ans , sav;
struct opt
{
	int x , y , d;
};
vector< opt > q[550];
void work( int x , int y , int a , int d )
{
	if(d != a) swap(p[x] , p[y]);
}
int sortbij( int l , int r , int d , int t )
{
	if(l == r) return t - 1;
	int mid = l + r >> 1 , it1 = l , it2 = mid + 1;
	while(it1 <= mid && it2 <= r)
	{
		q[t].push_back((opt){it1 , it2 , d});
		it1++; it2++;
	}
	return max(sortbij(l , mid , d , t + 1) , sortbij(mid + 1 , r , d , t + 1));
}
int sortseq( int l , int r , int d , int t )
{
	if(l == r) return t - 1;
	int mid = l + r >> 1;
	int qwq = max(sortseq(l , mid , d , t) , sortseq(mid + 1 , r , d ^ 1 , t)) + 1;
	return sortbij(l , r , d , qwq);
}
void solve( int n , int lim ) 
{
	N = n; n = (1 << ((int)log2(n - 1) + 1));
//	cerr << N << ' ' << n << endl;
	for(int i = 1 ; i <= n ; i++ ) p[i] = i;
	t = sortseq(1 , n , 1 , 1);
	for(int i = 1 ; i <= t ; i++ )
	{
		for(opt qwq : q[i]) 
			if(p[qwq.x] <= N && p[qwq.y] <= N) schedule(p[qwq.x] , p[qwq.y]);
//		for(opt qwq : q[i]) cerr << qwq.x << ' ' << qwq.y << ' ' << qwq.d << endl;
//		cerr << endl;
		sav = visit(); int it = 0; ans.clear();
		for(opt qwq : q[i]) 
		{
			if(p[qwq.x] <= N && p[qwq.y] <= N) ans.push_back(sav[it]) , it++;
			if(p[qwq.x] <= N && p[qwq.y] > N) ans.push_back(1);
			if(p[qwq.x] > N && p[qwq.y] <= N) ans.push_back(0);
			if(p[qwq.x] > N && p[qwq.y] > N) ans.push_back(p[qwq.x] < p[qwq.y]);
		}
		for(int j = 0 ; j < q[i].size() ; j++ )
			work(q[i][j].x , q[i][j].y , q[i][j].d , ans[j]);
	}
	vector< int > q;
	for(int i = 1 ; i <= N ; i++ ) q.push_back(p[i]);
	answer(q);
}
/*
5 123
5 3 4 2 1
*/