import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
static int cos(int l,int r,int []a)
{
    int i;int or,max,min,and;or=max=min=and=a[l];
    for(i=l+1;i<=r;i++)
    {
        if(max<a[i])
        max=a[i];
        if(min>a[i])
        min=a[i];
        or=or|a[i];
        and=and&a[i];
    }
    return ((or-and)-(max-min));
}

    static int[] costlyIntervals(int n, int k, int[] a) {
    int i,j;int []res=new int[n];
    for(i=0;i<n;i++)
    res[i]=-1;
    for(i=0;i<n;i++)
    {
        for(j=i;j<n;j++)
        {
            int cost=cos(i,j,a);
            if(k<=cost)
            {
                int m;int len=j-i+1;
                for(m=i;m<=j;m++)
                {
                    if(res[m]<len)
                    res[m]=len;
                }
            }
        }
    }return res;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int[] A = new int[n];
        for(int A_i = 0; A_i < n; A_i++){
            A[A_i] = in.nextInt();
        }
        int[] result = costlyIntervals(n, k, A);
        for (int i = 0; i < result.length; i++) {
      System.out.print(result[i] + (i != result.length - 1 ? "\n" : ""));
        }
        System.out.println("");


        in.close();
    }
}