#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
using namespace std;
const int N = 100005;
int n, k;
int a[N];
priority_queue < pair < int, int > > Q;
int main() {
    cin>>n>>k;
    for (int i = 1; i <= n; i++)
        cin>>a[i];
    if (k == 0){
        for (int i = 1; i <= n; i++)
            cout<<n<<endl;
        return 0;
    }
    Q.push({-1, n + 5});
    for (int i = 1; i <= n; i++){
        int x = a[i], y = a[i], z = a[i], t = a[i];
        for (int j = i + 1; j <= n; j++){
            x = max (x, a[j]);
            y = min (y, a[j]);
            z |= a[j];
            t &= a[j];
            if (z - t - x + y >= k)
                Q.push({j - i + 1, j});
        }
        while (Q.top().second < i)
            Q.pop();
        cout<<Q.top().first<<endl;
    }
    return 0;
}