#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = (1 << 20) + 500;

int n, k, ofs;
int p[MAXN], pos[MAXN], t[MAXN * 2], sol[MAXN];

void ubaci (int x, int k) {
    //cout << "ubaci pos " << x << endl;
    x += ofs;
    t[x] += k;
    x /= 2;
    while (x > 0) {
        t[x] = t[2 * x] + t[2 * x + 1];
        x /= 2;
    }
}

void ispis () {
    cout << "tour" << endl;
    for (int i = 1; i <= 2 * ofs; i++) {
        cout << "bla " << i << " " << t[i] << endl;
    }
}

int odredi (int val) {
    //cout << "odredi " << val << endl;
    int node = pos[val] + ofs;
    int bad = 0;
    for (int i = 1; i <= n; i++) {
        int par = node / 2;
        bad = (1 << i) - (1 + t[par]);
        //cout << "sad na " << i << endl;
        //cout << "bad je " << bad << endl;
        if (bad > k || (1 << i) > val) return i - 1;
        node = par;
    }
    return n;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    ofs = (1 << n);
    for (int i = 0; i < (1 << n); i++) {
        cin >> p[i];
        pos[p[i]] = i;
    }
    for (int val = 1; val <= (1 << n); val++) {
        sol[pos[val]] = odredi(val);
        ubaci(pos[val], 1);
    }
    for (int i = 0; i < (1 << n); i++) {
        cout << sol[i] << " ";
    }
    cout << endl;
    return 0;
}