#include <bits/stdc++.h>

using namespace std;

vector <int> costlyIntervals(int n, int k, vector <long long> arr) {
    vector<int> ans(n,-1);
    long tempans = 0;
    for(long i=0;i<n;i++){
        long long orval, andval, maxval, minval, cost;
        orval = andval = maxval = minval = arr[i];
        cost = 0;
        tempans = 0;
        long j = i+1;
        for(;j<n;j++){
            orval |= arr[j];
            andval &= arr[j];
            minval = min(minval, arr[j]);
            maxval = max(maxval, arr[j]);
            cost = orval - andval - maxval + minval;
            if(cost >= k){
                tempans = j-i+1;
            }
        }
        for(long j = 0; j < tempans; j++){
            if(tempans > ans[i+j])
                ans[i+j] = tempans;
        }
    }
    return ans;
}

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


    return 0;
}