#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-9;
const int N=2e6+7;
int n,m;
int a[N];
int pos[N];
int ans[N];
int rot[N];
int res;
struct node{
    int l;
    int r;
    int s;
}t[N<<2];
void pushup(int rt){
    t[rt].s=t[ls].s+t[rs].s;
    return ;
}
void build(int l,int r,int rt){
    t[rt].l=l;
    t[rt].r=r;
    if(t[rt].l==t[rt].r){
        t[rt].s=1;
        rot[t[rt].l]=rt;
        return ;
    }
    int mid=(l+r)>>1;
    build(l,mid,ls);
    build(mid+1,r,rs);
    pushup(rt);
}
void update(int id,int val,int rt){
    if(t[rt].l==t[rt].r){
        t[rt].s+=val;
        return ;
    }
    int mid=(t[rt].l+t[rt].r)>>1;
    if(id<=mid) update(id,val,ls);
    else update(id,val,rs);
    pushup(rt);
}
int query(int rt){
    int cnt=1;
    int an=0;
    //cout<<res<<"!!"<<endl;
    while((rt>>cnt)>=1&&m>=t[rt>>cnt].s&&t[rt>>cnt].s<=(res-(t[rt>>cnt].r-t[rt>>cnt].l+1-t[rt>>cnt].s))){
        an=cnt;
        cnt++;
    }
    return an;
}
void solve(){
	cin>>n>>m;
    for(int i=1;i<=(1<<n);i++){
        cin>>a[i];
        pos[a[i]]=i;
    }
    build(1,(1<<n),1);
    res=0;
    for(int i=1;i<=(1<<n);i++){
        res++;
        update(pos[i],-1,1);
        //cout<<i<<"!"<<rot[pos[i]]<<endl;
        ans[i]=query(rot[pos[i]]);
    }
    for(int i=1;i<=(1<<n);i++){
        cout<<ans[a[i]]<<" ";
    }
    cout<<endl;
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
}