#include <bits/stdc++.h>

using namespace std;
int find(int l,int r,vector<int> A){
    vector<int> res(4);
    res[0]=A[l];
    res[1]=A[l];
    res[2]=A[l];
    res[3]=A[l];
        for(int x=l+1;x<=r;x++){
            if(A[x]>res[0])
                res[0]=A[x];
            if(A[x]<res[1])
                res[1]=A[x];
            res[2]=res[2]|A[x];
            res[3]=res[3]&A[x];
        }
    int ans=(res[2]-res[3])-(res[0]-res[1]);
    return ans;
    
}

vector <int> costlyIntervals(int n, int k, vector <int> A) {
    vector<int> out(n);
    for(int v=0;v<n;v++)
        out[v]=-1;
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j++){
            int art=find(i,j,A);
            if(art>=k){
                int size=j-i+1;
                for(int y=i;y<=j;y++)
                {
                    if(out[y]<size)
                        out[y]=size;
                }
            }
        }
    }
    return out;
    // Return a list of length n consisting of the answers
}

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;
}