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

public class Solution {

    static int[] costlyIntervals(int n, int k, int[] A) {
        int ans[]=new int[n];int c=0; 
        int or=0,and=1,ma=0,mi=1000000000,s,l=0,I=0,J=0;
        for(int i=0;i<n;i++){
            for(int j=i;j<n;j++){
                and=A[i];or=0;ma=0;mi=1000000000;c=0;
                for(int k1=i;k1<=j;k1++){
                    or^=A[k1];
                    and&=A[k1];
                    ma=Math.max(ma,A[k1]);
                    mi=Math.min(mi,A[k1]);
                }
                c=(or-and)-(ma-mi); 
                if(c>=k){
                    s=j-i+1;
                    if(s>l){ 
                        l=s;
                        I=i;
                        J=j;
                    }
                }
            }
        }
        for(int i=0;i<n;i++){
            if(I==i||J==i)
            ans[i]=l;
            else
                ans[i]=-1;
        }
        return ans;
    }

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