/*Flow..................*/
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <functional>
#include <list>
#include <deque>
#include <bitset>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <sstream>
#include <complex>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <climits>
#include <utility>
#include <ctime>
#include <tuple>
#include <fstream>
#include <cctype>
#define FOR(i,a,n) for(i=a;i<n;i++)
#define FORD(i,a,n) for(i=a;i>=n;i--)
#define FORS(i,a) for(i=0;a[i];i++)
#define si(x) scanf("%d",&x)
#define sc(x) cin>>x
#define sd(x) scanf("%lf",&x)
#define sll(x) scanf("%lld",&x)
#define ss(x) scanf("%s",x)
#define prs(x) printf("%d ",x)
#define pls(x) printf("%lld ",(long long)x)
#define pc(x) printf("%c",(char)x)
#define pi(x) printf("%d\n",x)
#define pd(x) printf("%0.10lf\n",x);
#define pll(x) printf("%lld\n",(long long)x)
#define ps(x) printf("%s\n",x)
#define M 1000000007
#define ll long long
#define mp make_pair
#define all(x) x.begin(),x.end()
#define pb push_back
#define fr first
#define se second
#define in insert
#define er erase
#define pii pair<int, int>
#define plll pair<long long, long long>
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230
#define bs(x,y,z,w) {cerr<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<" "<<#w<<"="<<w<<endl;}
#define ts(x,u,y,z,w) {cerr<<x<<" "<<#u<<"="<<u<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<" "<<#w<<"="<<w<<endl;}
#define trace(x) {cerr << #x << "=" << x <<endl;}
#define trace2(x, y) {cerr << #x << "=" << x << " " << #y << "=" << y <<endl;}
#define trace3(x, y, z) {cerr << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z << endl;}
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T> &p){os << "[ "; for (T x: p) os << x << " "; os << "]" << endl; return os;}
template <typename T> ostream& operator<<(ostream& os, const set<T> &p){os << "{ "; for (T x: p) os << x << " "; os << "}" << endl; return os;}
template <typename T> ostream& operator<<(ostream& os, const multiset<T> &p){os << "{ "; for (T x: p) os << x << " "; os << "}" << endl; return os;}
template <typename Tk, typename Tv> ostream& operator<<(ostream& os, const map<Tk, Tv> &p){os << "{ "; for (pair<Tk, Tv> x: p) os << x << " "; os << "}" << endl; return os;}
template <typename Tk, typename Tv> ostream& operator<<(ostream& os, const pair<Tk, Tv> &p){os << "{" << p.first << ',' << p.second << "}";return os;}
ll gcd (ll a, ll b) {return ( a ? gcd(b%a, a) : b );}
ll power(ll a, ll n) {ll p = 1;while (n > 0) {if(n&1) {p = p * a;} n >>= 1; a *= a;} return p;}
ll power(ll a, ll n, ll mod) {ll p = 1;while (n > 0) {if(n&1) {p = p * a; p %= mod;} n >>= 1; a *= a; a %= mod;} return p % mod;}

const int N=100005;
ll a[N];
ll tr[4*N],la[4*N];
int n,k;
ll mn[20][N],mx[20][N],orr[20][N],andd[20][N];

void pushdown(int si,int s,int e)
{
	if(!la[si])
		return;
	tr[si]=max(tr[si],la[si]);
	if(s!=e)
	{
		la[2*si+1]=max(la[2*si+1],la[si]);
		la[2*si+2]=max(la[2*si+2],la[si]);
	}
}

void update(int si,int s,int e,int l,int r,ll x)
{
	pushdown(si,s,e);
	if(s>e || r<s || e<l)
		return;
	if(l<=s && e<=r)
	{
		la[si]=max(la[si],x);
		pushdown(si,s,e);
		return;
	}
	int mid=(s+e)/2;
	update(2*si+1,s,mid,l,r,x);
	update(2*si+2,mid+1,e,l,r,x);
	tr[si]=max(tr[2*si+1],tr[2*si+2]);
}

ll query(int si,int s,int e,int l,int r)
{
	pushdown(si,s,e);
	if(s>e || r<s || e<l)
		return -1;
	if(l<=s && e<=r)
		return tr[si];
	int mid=(s+e)/2;
	return max(query(2*si+1,s,mid,l,r),query(2*si+2,mid+1,e,l,r));
}
//care for 0 based indexing
void pre()
{
	int i,j;
	FOR(i,1,n+1)
	{
		mn[0][i]=mx[0][i]=a[i];
		orr[0][i]=andd[0][i]=a[i];
	}
	for(j=1;(1<<j)<=n;j++)
		for(i=1;i+(1<<j)-1<=n;i++)
		{
			mn[j][i]=min(mn[j-1][i] , mn[j-1][i+(1<<(j-1))]);
			mx[j][i]=max(mx[j-1][i] , mx[j-1][i+(1<<(j-1))]);
			orr[j][i]=orr[j-1][i] | orr[j-1][i+(1<<(j-1))];
			andd[j][i]=andd[j-1][i] & andd[j-1][i+(1<<(j-1))];
		}
}
ll queryy(int l,int r)
{
	int k=log2(r-l+1);
	ll mnn=min(mn[k][l],mn[k][r-(1<<k)+1]);
	ll mxx=max(mx[k][l],mx[k][r-(1<<k)+1]);
	ll orrr=orr[k][l] | orr[k][r-(1<<k)+1];
	ll anddd=andd[k][l] & andd[k][r-(1<<k)+1];
	// trace2(l,r);
	// trace2(mnn,mxx);
	// trace2(orrr,anddd);
	return ((orrr-anddd)-(mxx-mnn));
}

int main()
{
   int i,j;
   si(n),si(k);
   FOR(i,1,n+1)
   	sll(a[i]);
   memset(tr,-1,sizeof tr);
   memset(la,-1,sizeof la);
	pre();   
	FOR(i,1,n+1)
		FOR(j,i,n+1)
		{
			ll ans=queryy(i,j);
			// trace3(i,j,ans);
			// puts("");
			if(ans>=k)
				update(0,0,n,i,j,j-i+1);
		}
	FOR(i,1,n+1)
		pll(query(0,0,n,i,i));
   return 0;
}