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

using namespace std;

void solve(int n, int V) {
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 1);

    vector<pair<int, int>> pairs;

    auto add = [&](int i, int j) {
        schedule(ord[i], ord[j]);
        pairs.emplace_back(i, j);
    };
    auto sort = [&]() {
        vector<int> v = visit();
        for (int k = 0; k < size(v); ++k) {
            if (!v[k]) {
                swap(ord[pairs[k].first], ord[pairs[k].second]);
            }
        }
        pairs.clear();
    };

    int N = 1 << __lg(n - 1) + 1;
    for (int s = 1; s < N; s <<= 1) {
        for (int k = s; k > 0; k >>= 1) {
            for (int j = k % s; j + k < n; j += 2 * k) {
                for (int i = 0; i < k && j + k + i < n; ++i) {
                    if ((j + i) / 2 * s == (j + i + k) / 2 * s) {
                        add(j + i, j + i + k);
                    }
                }
            }
            sort();
        }
    }

    answer(ord);
}