#include "swaps.h"

#include <iostream>
#include <algorithm>
#include <vector>

typedef long long ll;
typedef double lf;

using namespace std;

const int MAXN = 2e3 + 50;

int n, m, a[MAXN];
vector <int> ret, ans;

void cpr(int &x, int &y)
{
    if (x <= m && y <= m) schedule(x, y);
    else if (y <= m) swap(x, y);
}
void solve(int N, int V)
{
    n = 1, m = N;
    while (n < N) n <<= 1;
    for (int i = 1; i <= n; i++) a[i] = i;
    int w;
    for (w = 1; w <= n; w <<= 1)
    {
        for (int j = w; j >= 1; j >>= 1)
        {
            for (int l = 1, r = j; r + j <= n; l += 2 * j, r = l + j - 1)
                for (int i = l; i <= r; i++)
                    if (l / (2 * w) & 1) cpr(a[i + j], a[i]);
                    else cpr(a[i], a[i + j]);
            ret = visit(); int top = 0;
            for (int l = 1, r = j; r + j <= n; l += 2 * j, r = l + j - 1)
                for (int i = l; i <= r; i++)
                    if (a[i] <= m && a[i + j] <= m && !ret[top++]) swap(a[i], a[i + j]);
            // for (int i = 1; i <= n; i++) cout << a[i] << " "; cout << "\n";
        }
    }
    for (int i = 1; i <= m; i++) ans.push_back(a[i]);
    answer(ans);
}