#include <bits/stdc++.h>
#include "swaps.h"

using namespace std;

void solve(int N, int V) {
	vector<int> ans(N); iota(ans.begin(), ans.end(), 1);
	for (int p = 1; p < N; p *= 2)
		for (int k = p; k; k /= 2) {
			for (int j = k % p; j <= N - k - 1; j += k * 2)
				for (int i = 0; i <= min(k - 1, N - j - k - 1); ++i)
					if ((i + j) / (p * 2) == (i + j + k) / (p * 2))
						schedule(ans[i + j], ans[i + j + k]);
			vector<int> res = visit(); int cnt = 0;
			for (int j = k % p; j <= N - k - 1; j += k * 2)
				for (int i = 0; i <= min(k - 1, N - j - k - 1); ++i)
					if ((i + j) / (p * 2) == (i + j + k) / (p * 2))
						if (!res[cnt++]) swap(ans[i + j], ans[i + j + k]);
		}
	answer(ans);
}