#include "bits/stdc++.h"

#ifdef PRINTERS
#include "printers.hpp"
using namespace printers;
#define tr(a)		cerr<<#a<<" : "<<a<<endl
#else
#define tr(a)    
#endif

#define ll          long long
#define pb          push_back
#define pii         pair<int,int>
#define vi          vector<int>
#define vii 		vector<pii>
#define mi 			map<int,int>
#define mii			map<int,pii>	
#define all(a)      (a).begin(),(a).end()
#define x           first
#define y           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define endl        '\n'
#define rep(i,a,b)	for(int i=a;i<b;i++)
using namespace std;
int n,a[100005],k,cost,t[10005];
void modify(int l, int r, int value) {
  for (l+= n,r+= n; l < r; l >>= 1, r >>= 1) 
  {
    if (l&1) 
    {
   		t[l]=max(t[l],value);
   		l++;
   	}
    if (r&1) 
    {
    	t[r-1]=max(t[r-1],value);
    	r--;
    }
  }
}
int query(int p) {
  int res=-1;
  for (p += n; p > 0; p >>= 1) res=max(res,t[p]);
  return res;
}

void solve()
{
	memset(t,-1,sizeof t);
	cin>>n>>k;
	rep(i,0,n) cin>>a[i];	
	vector<pair<int,pii>>v;
	rep(i,0,n)
	{
		int M=0,m=1e9,O=0,A=(1LL<<31)-1;
		rep(j,i,n)
		{
			A=A&a[j];
			M=max(M,a[j]);
			m=min(m,a[j]);
			O=O|a[j];
			cost=O-A-M+m;
			if(cost>=k)
			v.pb({j-i+1,{i,j}});
		}
	}
	sort(all(v));
	for(int i=0;i<sz(v);++i)
	modify(v[i].y.x,v[i].y.y+1,v[i].x);
	for(int i=0;i<n;++i)
	cout<<query(i)<<"\n";
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t=1;
//	cin>>t;
	while(t--)
		solve();
	return 0;
}