#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define all(a) (a.begin(),a.end())
#define fi first
#define sc second
#define ort(x,y) (x+y)/2
#define endl '\n'
#define FAST ios_base::sync_with_stdio(false);
#define d1(x) cerr<<#x<<":"<<x<<endl;
#define d2(x,y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl;
#define d3(x,y,z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl;
#define N (int) (5e3+5)
#define M (int) ()
#define inf (int) (1e18+5)
#define p (1000000007)
#define heap priority_queue
#define mem(a,val) memset(a,val,sizeof(a))
#define y1 asdassa
typedef long long int lli;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
struct node
{
	lli mx,mn,orr,andd;
}seg[N<<2];
int n,ans,ans1,ans2,k,ar[N],nar[N];
node build(int ind,int l,int r)
{
	if(l==r) return seg[ind]={ar[l],ar[l],ar[l],ar[l]};
	int mid=(l+r)/2;
	node t1=build(ind+ind,l,mid);
	node t2=build(ind+ind+1,mid+1,r);
	return seg[ind]={max(t1.mx,t2.mx),min(t1.mn,t2.mn),t1.orr | t2.orr,t1.andd & t2.andd};
}
node get(int ind,int l,int r,int lw,int rw)
{
	if(l>=lw && r<=rw) return seg[ind];
	if(l>rw || r<lw) return {-inf,inf,0,(1<<33)-1};
	int mid=(l+r)/2;	
	node t1=get(ind+ind,l,mid,lw,rw);
	node t2=get(ind+ind+1,mid+1,r,lw,rw);
	return {max(t1.mx,t2.mx),min(t1.mn,t2.mn),t1.orr | t2.orr,t1.andd & t2.andd};	
}
int main()
{
	mem(nar,-1);
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++)
		scanf("%d",&ar[i]);
	build(1,1,n);
	for(int i=1;i<=n;i++)
	{
		for(int j=i;j<=n;j++)
		{
			node tut=get(1,1,n,i,j);
			if(i==5 && j==5)
			{
				d2(tut.orr,tut.andd);
				d2(tut.mx,tut.mn);
			}
			if((tut.orr-tut.andd)-(tut.mx-tut.mn)>=k)
				for(int t=i;t<=j;t++)
					nar[t]=max(nar[t],j-i+1);
		}
	}
	for(int i=1;i<=n;i++)
		printf("%d\n",nar[i]);
}