#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(20070819);
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=1e5+5;
const int MA=11,MB=11;
int n,a[N],k;
vector<pair<int,int> >ques[N];
ll ans[N];
int b1[1<<MA][1<<MB],b2[1<<MA][1<<MB];

signed main(void){

#ifndef ONLINE_JUDGE
	// freopen("in.txt","r",stdin);
	freopen("ex_world3.in","r",stdin);
	freopen("out.out","w",stdout);
#endif

	// double St=clock();
	n=read(),k=read();
	for(int i=1;i<=n;i++)a[i]=read();

	// vector<int>p(k);
	// for(int i=0;i<k;i++)p[i]=i;shuffle(p.begin(),p.end(),rnd);
	// auto getv=[&](int x){int y=0;for(int i=0;i<k;i++)if(x&(1<<i))y|=(1<<p[i]);return y;};
	// for(int i=1;i<=n;i++)a[i]=getv(a[i]);

	int A=(int)(k/2),B=k-A;
	// if(k>=10)A-=2,B+=2;
	int U2=(1<<B)-1,U1=((1<<A)-1)<<B;
	// cout<<"A = "<<A<<" B = "<<B<<" U1,U2 = "<<U1<<" "<<U2<<endl;

	for(int S=0;S<(1<<A);S++)for(int T=0;T<(1<<B);T++)b1[S][T]=b2[S][T]=n+1;

	ll zero=0;
	auto qsum=[&](int C,int p){
		ll res=0;
		// cout<<"qsum C = "<<C<<" p = "<<p<<endl;
		while(p<=n){
			int C1=((C&U1)>>B),C2=(C&U2);
			int to=n+1;
			if(__builtin_popcount(C1)<=__builtin_popcount(C2)){
				for(int S=C1;;S=((S-1)&C1)){cmin(to,b1[S][C2]);if(S==0)break;}
			}
			else{
				for(int S=C2;;S=((S-1)&C2)){cmin(to,b2[C1][S]);if(S==0)break;}
			}
			p=to+1;if(to<=n)res+=to,C-=a[to];
			// cout<<"p = "<<p<<endl;
		}
		return res;
	};
	auto ins=[&](int C,int i){
		int C1=((C&U1)>>B),C2=(C&U2);
		// cout<<"ins C = "<<C<<" i = "<<i<<" C1,C2 = "<<C1<<" "<<C2<<endl;
		for(int S=C1;;S=((S+1)|C1)){b2[S][C2]=i;if(S==(U1>>B))break;}
		// puts("ok");
		for(int S=C2;;S=((S+1)|C2)){b1[C1][S]=i;if(S==U2)break;}
	};
	for(int i=n;i>=1;i--){
		if(a[i]==0){ans[i]=ans[i+1]+k*i,zero+=k*i;continue;}
		ins(a[i],i);ans[i]=zero;
		for(int j=0;j<k;j++)ans[i]+=qsum((1<<k)-1-(1<<j),i);
	}

	for(int i=1;i<=n;i++)cout<<ans[i]<<" \n"[i==n];
	// cerr<<"St = "<<clock()-St<<"ms\n";

	return 0;
}