#include <bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
ll maximum(int,int,vector <ll>);
ll minimum(int,int,vector <ll>);
ll OR(int,int,vector <ll>);
ll AND(int,int,vector <ll>);
int maxi(int ,int );
vector <int> costlyIntervals(int,int,vector <ll>);
ll maximum(int i,int j,vector<ll>A){
    ll max=A[i];
    for(int k=i+1;k<=j;k++)if(A.at(k)>max)max=A.at(k);
    return max;
}
ll minimum(int i,int j,vector<ll>A){
    ll min=A[i];
    for(int k=i+1;k<=j;k++)if(A.at(k)<min)min=A.at(k);
    return min;
}
ll OR(int i,int j,vector<ll>A){
   ll ORo=A.at(i);
    for(int k=i+1;k<=j;k++)ORo=ORo|A.at(k);
    return ORo;
}
ll AND(int i,int j,vector<ll>A){
    ll And=A[i];
    for(int k=i+1;k<=j;k++)And=And&A.at(k);
    return And;
}
int maxi(int i,int j){
    if(i>j)return i;
    else return j;
}
vector <int> costlyIntervals(int n, int k, vector <ll> A) {
    vector<int>arr;
    for(int i=0;i<n;i++){
        ll count=0;
        for(int j=0;j<n;j++){
            ll max,min,Or,And;
            if(i<j)
            {  min=minimum(i,j,A);
             max=maximum(i,j,A);
             Or=OR(i,j,A);
             And=AND(i,j,A);}
            else 
            {
             min=minimum(j,i,A);
             max=maximum(j,i,A);
             Or=OR(j,i,A);
             And=AND(j,i,A);  
            }
            ll cost=((Or-And)-(max-min));
            if(cost>=k){
                if(maxi(j-i+1,i-j+1)>count)count=maxi(j-i+1,i-j+1);
            }
        }
        if(count==0)count=-1;
        arr.push_back(count);
    }
    return arr;
    // Return a list of length n consisting of the answers
}

int main() {
    int n;
    ll k;
    cin >> n >> k;
    vector<ll> A(n);
    for(int A_i = 0; A_i < n; A_i++){
       cin >> A[A_i];
    }
    vector <int> result = costlyIntervals(n, k, A);
    for (ssize_t i = 0; i < result.size(); i++) {
        cout << result[i] << (i != result.size() - 1 ? "\n" : "");
    }
    cout << endl;


    return 0;
}