#include<bits/stdc++.h>
using namespace std;
int n,lgn,k,p[1<<20],invp[1<<20];
array<int,20>ls[1<<20],gr[1<<20];
void solve(int l,int r,int h){
   if(l==r)return;
   int mid=l+r>>1;
   solve(l,mid,h-1),solve(mid+1,r,h-1);
   vector<int>a(p+l,p+mid+1),b(p+mid+1,p+r+1);
   for(int i=l,x=0,y=0;i<=r;i++){
      if(y==b.size()||(x<a.size()&&a[x]<b[y])){
         int u=invp[a[x]];
         ls[u][h]=y,gr[u][h]=b.size()-y;
         p[i]=a[x],x++;
      }else{
         int u=invp[b[y]];
         ls[u][h]=x,gr[u][h]=a.size()-x;
         p[i]=b[y],y++;
      }
   }
}
int main(){
   scanf("%d%d",&lgn,&k),n=1<<lgn;
   for(int i=0;i<n;i++){
      scanf("%d",&p[i]),p[i]--,invp[p[i]]=i;
   }
   solve(0,n-1,lgn);
   for(int i=0;i<n;i++){
      int s=0,t=0;
      for(int x:ls[i])s+=x;
      while(t<lgn){
         s-=ls[i][t+1],s-=gr[i][t+1];
         if(s<0)break;t++;
      }printf("%d ",t);
   }
   return 0;
}