#include "swaps.h"
#include <array>
#include <vector>
#include <utility>
using namespace std;

void solve(int N,int V){
	vector<int> v(N);
	for(int i=0;i<N;++i)
		v[i]=i+1;
	auto Get=[](int n){
		int k=1;
		while((k<<1)<n)
			k<<=1;
		return k;
	};
	vector<pair<vector<array<int,3>>,int>> a;
	vector<array<int,3>> b,c;
	a.emplace_back(vector{array{0,N,0}},0);
	while(a.size()){
		if(a.back().second==0){
			vector<array<int,3>> node_a;
			for(auto &[p,n,dir]:a.back().first){
				if(n>1){
					int m=(n>>1);
					node_a.push_back({p,m,!dir});
					node_a.push_back({p+m,n-m,dir});
				}
			}
			a.back().second=1;
			if(node_a.size())
				a.emplace_back(vector{node_a},0);
		}else{
			for(auto &_:a.back().first)
				b.push_back(_);
			while(b.size()){
				size_t __=0;
				c.clear();
				for(auto &[p,n,dir]:b){
					if(n>1){
						int m=Get(n);
						for(int i=p;i<p+n-m;++i)
							schedule(v[i],v[i+m]);
						++__;
					}
				}
				auto _=(__?visit():vector<int>());
				__=0;
				for(auto &[p,n,dir]:b){
					if(n>1){
						int m=Get(n);
						for(int i=p;i<p+n-m;++i)
							if(_[__++]==dir)
								swap(v[i],v[i+m]);
						c.push_back({p,m,dir});
						c.push_back({p+m,n-m,dir});
					}
				}
				b=c;
			}
			a.pop_back();
		}
	}
	answer(v);
}