#include "swaps.h"

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

typedef long long ll;
typedef double lf;

using namespace std;

const int MAXN = 510;

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

void solve(int N, int V)
{
    n = N;
    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 <= n; l += 2 * j, r = l + j - 1)
                for (int i = l; i <= r && i + j <= n; i++)
                    if (l / (2 * w) & 1) schedule(a[i + j], a[i]);
                    else schedule(a[i], a[i + j]);
            ret = visit(); int top = 0;
            for (int l = 1, r = j; r <= n; l += 2 * j, r = l + j - 1)
                for (int i = l; i <= r && i + j <= n; i++)
                    if (!ret[top++]) swap(a[i], a[i + j]);
        }
    }
    for (int i = 1; i <= n; i++) ans.push_back(a[i]);
    answer(ans);
}