#include <bits/stdc++.h>
using namespace std;

int o,a,M,m,lastK;
vector <int> resp;

vector <int> costlyIntervals(int n, int k, vector <int> A) {
    // Return a list of length n consisting of the answers
    for(int i=0; i<n; i++){
        o = a = A[i];
        M = m = A[i];
        lastK = i-2;
        for(int j=i+1; j<n; j++){
            o = o | A[j];
            a = a & A[j];
           if(A[j]>M) M=A[j];
           if(A[j]<m) m = A[j];
            if(o-a-M+m>=k) lastK = j;
        }
        for(int j=i; j<=lastK; j++) resp[j] = max(resp[j],lastK-i+1);
    }
    return resp;
}

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