#ifndef hwe
#include "swaps.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
#ifdef hwe
vector<int> buffer;
int a[N];
void schedule(int i, int j) {
buffer.emplace_back(a[i] > a[j]);
}
vector<int> visit() {
vector<int> ret = buffer; buffer.clear();
return ret;
}
void answer(vector<int> r) {
for (auto &x : r) cerr << x << ' ';
cerr << '\n';
}
#endif
void print(vector<int> &ve) {
for (auto &x : ve) cerr << x << ' ';
cerr << '\n';
}
void solve(int n, int V) {
vector<int> p(n, 0); iota(p.begin(), p.end(), 1);
int m = n;
while (POPCOUNT(m) != 1) p.emplace_back(++m);
for (int len = 2; len <= m; len <<= 1) {
int d = len / 2;
while (d > 0) {
vector<int> idx, dir;
for (int i = 0; i < m; ++i) {
int match = i ^ d;
if (match < i) {
if (p[match] > n || p[i] > n) {
if ((p[i] > n) == ((i & len) != 0)) swap(p[match], p[i]);
continue;
}
schedule(p[match], p[i]);
idx.emplace_back(i);
dir.emplace_back((i & len) != 0);
}
}
vector<int> ve = visit();
for (int i = 0; i < ve.size(); ++i)
if (ve[i] == dir[i]) swap(p[idx[i] ^ d], p[idx[i]]);
d >>= 1;
}
}
answer(vector<int>(p.begin(), p.begin() + n));
}
#ifdef hwe
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n, V; cin >> n >> V;
for (int i = 1; i <= n; ++i) cin >> a[i];
solve(n, V);
return 0;
}
#endif
