#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 40,MAXM = 20;

ll n,m,p,a[MAXN];

typedef array<ll,2> pr; //(val,mask)

pr L[(1<<MAXM)+10],R[(1<<MAXM)+10];

typedef array<ll,3> tr;

int x,y;

tr qry(ll l,ll r){ 
	ll ra = -1,rb = -1,cnt = 0;

	auto add = [&](ll mask){
		//printf("add %lld\n",mask);

		if(ra == -1)ra = mask;
		else rb = mask;
	};

	//a+b in [l,r]
	for(int i=1,pl=y,pr=y;i<=x;i++){
		while(pl && L[i][0] + R[pl][0] >= l)pl--;
		while(pr && L[i][0] + R[pr][0] > r)pr--;

		rep(j,pl+1,pr){
			ll mask = L[i][1] + (R[j][1] << m);
			add(mask);

			if(rb != -1)break;
		}
		cnt += max(0,pr-pl);
	}
	
	//a+b in [l+p,r+p]
	
	for(int i=1,pl=y,pr=y;i<=x;i++){
		while(pl && L[i][0] + R[pl][0] >= l+p)pl--;
		while(pr && L[i][0] + R[pr][0] > r+p)pr--;

		rep(j,pl+1,pr){
			ll mask = L[i][1] + (R[j][1] << m);
			add(mask);

			if(rb != -1)break;
		}
		cnt += max(0,pr-pl);
	}

	assert(ra != -1);
	return {ra,rb,cnt};
}

ll ans[MAXN];

int main(){

	cin>>n>>p;
	rep(i,0,n-1)cin>>a[i];

	if(n==1){
		cout<<"1";
		exit(0);
	}

	m = n/2; //[0,m) and [m,n)

	rep(mask,0,(1<<m)-1){
		ll sum = 0;
		rep(j,0,m-1)if(mask>>j&1)sum = (sum + a[j])%p;
		L[++x] = {sum,mask};
	}
	rep(mask,0,(1<<(n-m))-1){
		ll sum = 0;
		rep(j,0,n-m-1)if(mask>>j&1)sum = (sum + a[m+j])%p;
		R[++y] = {sum,mask};
	}
	sort(L+1,L+1+x);
	sort(R+1,R+1+y);

	ll L = 0,R = p-1;
	while(L<R){
		ll mid = (L+R)>>1;
		ll cnt = qry(L,mid)[2];


		if(cnt > mid-L+1){
			R = mid;
		}else{
			L = mid+1;
		}
	}

	tr res = qry(L,L);

	assert(res[0] != -1 && res[1] != -1);

	rep(i,0,n-1)if(res[0]>>i&1)ans[i]++;
	rep(i,0,n-1)if(res[1]>>i&1)ans[i]--;

	rep(i,0,n-1)cout<<ans[i]<<" ";

    return 0;
}