#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

/*int* costlyIntervals(int n, int k, int A_size, int* A, int *result_size) {
    // Return a list of length n consisting of the answers
}*/

int main() {
    int n; 
    int k,i,j; 
    scanf("%i %i", &n, &k);
    int *A = malloc(sizeof(int) * n);
    for (int A_i = 0; A_i < n; A_i++) {
       scanf("%i",&A[A_i]);
    }
    for(i=0;i<n;i++)
    {
        int cost;
        for(j=i;j<n;j++)
        {
        int or=0,and=1,min=A[i],max=A[i];
            for(int k=i;k<=j;k++)
            {
                or=or|A[k];
                and=and&A[k];
                 if(min>A[k])
                     min=A[k];
                if(max<A[k])
                    max=A[k];
            }
            cost=(or-and)-(max-min);
            if(cost>=k)
            {
                //printf("%d",j-i+1);
                break;
            }
        }
        if(cost>=k)
            break;
        
    }
    for(int x=0;x<n;x++)
    {
        if(x>=i&&x<=j)
            A[x]=j-i+1;
        else
            A[x]=-1;
        printf("%d\n",A[x]);
    }
    /*int result_size;
    int* result = costlyIntervals(n, k, A, &result_size);
    for(int result_i = 0; result_i < result_size; result_i++) {
        if(result_i) {
            printf("\n");
        }
        printf("%d", result[result_i]);
    }
    puts("");
*/

    return 0;
}