#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>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef _DEBUG
#ifdef _DEBUG
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
const ll MOD=1e9+7;

// const int N=(1<<18); 

// struct NODE{
// 	int mx,q;
//   NODE(){
// 		mx=q=0;
//   }
// };
// //ostream& operator<<(ostream &os, NODE &t) { return os<<"("<<t.sum<<","<<t.x<<","<<t.d<<")";}
// NODE seg[2*N+10];

// inline void lazy_eval(int k,int a,int b){
//   MX(seg[k].mx,seg[k].q);
//   if(2*k<=2*N+5){
//     MX(seg[2*k+1].q+=seg[k].q);
//     MX(seg[2*k+2].q+=seg[k].q);
//   }
// }

// inline void update_node(int k){
//   MX(seg[k].mx,max(seg[2*k+1].mx,seg[2*k+2].mx));
// }

// void update(int l,int r,ll x,ll d,int k=0,int a=0,int b=N){
//   //cout<<"update:"<<l<<","<<r<<","<<x<<","<<d<<","<<a<<","<<b<<endl;
//   lazy_eval(k,a,b);
//   if(b<=l || r<=a) return; 
//   if(l<=a && b<=r){
//     (seg[k].x+=x+(a-l)*d%MOD)%=MOD;
//     (seg[k].d+=d)%=MOD;
//     lazy_eval(k,a,b);
//     return;
//   }	
//   int m=(a+b)/2;
//   update(l,r,x,d,2*k+1,a,m);
//   update(l,r,x,d,2*k+2,m,b);
//   update_node(k);
// }

// int get(int l,int r,int k=0,int a=0,int b=N){
//   lazy_eval(k,a,b);
//   if(b<=l || r<=a)return 0; 
//   if(l<=a && b<=r){return seg[k].sum;}
  
//   int m=(a+b)/2;
//   int vl=get(l,r,2*k+1,a,m);
//   int vr=get(l,r,2*k+2,m,b);
//   update_node(k);
//   //cout<<a<<","<<b<<":"<<vl<<","<<vr<<endl;
//   return (vl+vr)%MOD;
// }

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	int n,t;
	cin>>n>>t;
	vector<int> a(n);
	rep(i,n) cin>>a[i];
	vector<int> re(n,-1);
	rep(i,n){
		int o=0,an=(1<<30)-1;
		int mx=0,mn=MOD;
		int r=i;
		int last=-1;
		reps(j,i,n){
			MX(mx,a[j]); MN(mn,a[j]);
			an&=a[j]; o|=a[j];
			if(o-an-mx+mn>=t){
				last=j;
			}
		}
		if(last>=0){
			reps(j,i,last+1) MX(re[j],last+1-i);
		}
	}
	for(int x:re) cout<<x<<"\n";
  return 0;
}