#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

const int N = 20;

int cnt[(1 << N) + 50];

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n, k;
    std::cin >> n >> k;
    int m = (1 << n);
    std::vector<int> a(m + 1);
    fore(i, 1, m + 1) std::cin >> a[i];

    std::vector<int> ord(m + 1);
    fore(i, 1, m + 1) ord[i] = i;
    std::sort(ord.begin() + 1, ord.end(), [&](int i, int j){
        return a[i] > a[j];
    });

    std::vector<int> ans(m + 1);
    fore(idx, 1, m + 1){
        int i = ord[idx];
        int h = std::__lg(a[i]);
        int t = k;
        int u = (1 << n) - 1 + i;
        while(h){
            int fa = u / 2;
            if(t < cnt[fa]) break;
            --h;
            u = fa;
            ++ans[i];
        }

        u = i;
        while(u){
            ++cnt[u];
            u /= 2;
        }
    }

    fore(i, 1, m + 1) std::cout << ans[i] << " \n"[i == m];
    
    return 0;
}