#include <bits/stdc++.h>

using namespace std;

vector <int> costlyIntervals(int n, int k, vector <int> A) {
    // Return a list of length n consisting of the answers
    vector<int> res(n,-1);
	int maxim[n] = {0};
	for(int i=0; i<n; i++)
	{
		int AND = A[i], OR = A[i], MIN = A[i], MAX = A[i];
		for(int j=i; j<=n; j++)
		{
			AND = AND & A[j];
			OR = OR | A[j];
			MIN = min(MIN, A[j]);
			MAX = max(MAX, A[j]);
			int cost = (OR - AND) - (MAX - MIN);
			//cout << i+1 << " " << j+1 << " " << cost << endl;
			if(maxim[i] < cost and cost>=k)
			{
				maxim[i] = cost;
				res[i] = j-i+1;
			}
			if(maxim[j] < cost and cost>=k)
			{
				maxim[j] = cost;
				res[j] = j-i+1;
			}
		}	
	}   
	return res; 
}

int main() {
    int n;
    int k;
    cin >> n >> k;
    vector<int> 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;
}