#include <bits/stdc++.h>
//#define int long long
#define endl "\n"
using namespace std;

using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int N = 2e6 + 5;

struct BIT {
    ll tr[N];
    int n;
    BIT(int n = N - 1) : n(n) {
        memset(tr, 0, sizeof tr);
    }
    int lowbit(int x) {
        return x & -x;
    }
    void add(int x, int k) {
        for (int i = x; i <= n; i += lowbit(i)) {
            tr[i] += k;
        }
    }
    ll sum(int x) {
        ll res = 0;
        for (int i = x; i >= 1; i -= lowbit(i)) {
            res += tr[i];
        }
        return res;
    }
    ll sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }
} bit;

pair<int, int> a[N];
int ans[N];

int main() {
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);

    int n, k;
    cin >> n >> k;
    set<int> sp;
    for (int i = 1; i <= n; i++) {
        sp.insert(1 << i);
    }
    n = (1 << n);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a, a + n + 1);

    for (int i = 1; i <= n; i++) {
        auto& [x, id] = a[i];
        int l = id % 2 ? id : id - 1, r = id % 2 ? id + 1 : id;
        while (l >= 1 && r <= n && bit.sum(l, r) >= (r - l - k) && (r - l) < x) {
            ans[id]++;
            if (!sp.count(r) || l == 1)
                r = 2 * r - l + 1;
            else 
                l = 2 * l - r - 1;
        }
        bit.add(id, 1);
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }

    return 0;
}