#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

int A[100010];


int main() {
    int N, K;
    while(cin >> N >> K) {
        for(int i=0; i<N; i++) {
            cin >> A[i];
        }
    
        for(int i=0; i<N; i++) {
            int maxSize = -1;

            for(int j=0; j<N; j++) {
                int maxx = A[j], minn = A[j], dor = A[j], dand = A[j];
                
                int cost = (dor - dand) - (maxx - minn);
                if (cost >= K) maxSize = max(maxSize, 1);
                
                for(int k=j+1; k<N; k++) {
                    maxx = max(maxx, A[k]);
                    minn = min(minn, A[k]);
                    dor = dor | A[k];
                    dand = dand & A[k];

                    cost = (dor - dand) - (maxx - minn);
//                    cout << " " << cost;

                    if (cost >= K and j<=i and i<=k) maxSize = max(maxSize, k-j+1);
                }        
  //              cout << endl;
            }       
            
            cout << maxSize << endl;
        }

        
    }
}