#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
    bool f=false;
    for(int i=n;i>0;i--)
    {
        for(int j=0;j+i-1<n;j++)
        {
            long min=-1,max=-1;
            unsigned int r=0,d=1,cost;
            for(int k=j;k<j+i;k++)
            {
                if(min==-1 || min>a[k])
                    min=a[k];
                if(max==-1 || max<a[k])
                    max=a[k];
                r=r|a[k]; d=d&a[k];
            }
            cost=(r-d)-(max-min);
            if(cost>=k)
            {
                for(int u=0;u<n;u++)
                    if(u>=j && u<j+i)
                        a[u]=i;
                    else
                        a[u]=-1;
                f=!f; break;
            }
        }
        if(f)
            break;
    }
    return a;
}

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