#include <bits/stdc++.h>

using namespace std;

vector <long long int> costlyIntervals(long long int n, long long int k, vector <long long int> a) {
    // Return a list of length n consisting of the answers
    long long int x;
    //long long int cost[n][n][2];
    long long int c1,c2,c3,c4;
    //vector<pair<long long int ,pair<long long int, long long int> > > arr;
    vector<long long int> res(n);
    for(long long int i=0;i<n;i++){
      res[i]=-1;
        if(k==0) res[i]=1;
    }
    for(long long int i=0;i<n;i++){
        x=a[i];
        //cost[i][i][0]=x;cost[i][i][1]=x;cost[i][i][2]=x;cost[i][i][3]=x;
        c1=c2=c3=c4=x;
        for(long long int j=i+1;j<n;j++){
            
            /*cost[i][j][0]=a[j] | cost[i][j-1][0];
            cost[i][j][3]=a[j] & cost[i][j-1][3];
            cost[i][j][1]=max(a[j],cost[i][j-1][1]);
            cost[i][j][2]=min(a[j],cost[i][j-1][2]);
            long long int val = (cost[i][j][0]-cost[i][j][3])-(cost[i][j][1]-cost[i][j][2]);
            */
            c1 = a[j] | c1;
            c2 = a[j] & c2;
            c3 = max(a[j],c3);
            c4 = min(a[j],c4);
            long long int val = (c1-c2)-(c3-c4);
            if(val>=k){
                //cout<<val<<" "<<i<<" "<<j<<"\n";
                //arr.push_back(make_pair((j-i+1),make_pair(i,j)));
                for(int ri=i;ri<=j;ri++){
                    if(res[ri]<(j-i+1)){
                        res[ri] = (j-i+1);
                    }
                }
            }
        }
    }
     
    /*for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            cout<<(cost[i][j][0]-cost[i][j][3])-(cost[i][j][1]-cost[i][j][2])<<" ";
        }
        cout<<"\n";
    }*/
    return res;
}

int main() {
    long long int n;
    long long int k;
    cin >> n >> k;
    vector<long long int> A(n);
    for(long long int A_i = 0; A_i < n; A_i++){
       cin >> A[A_i];
    }
    vector <long long 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;
}