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

public class Solution {

    static int getMax(int[] array)
    {
        int i = -1;
        int n = -1;
        for(int x = 0;x<array.length;x++)
        {
            if(array[x]>n)
            {
                n = array[x];
                i = x;
            }
        }
        return array[i];
    }
    static int getMin(int[] array)
    {
        int i = -1;
        int n = 1000000002;
        for(int x = 0;x<array.length;x++)
        {
            if(array[x]<n)
            {
                n = array[x];
                i = x;
            }
        }
        return array[i];
    }
    static int getOR(int[] array)
    {
        int res = array[0];
        for(int i = 1;i<array.length;i++)
        {
            res |= array[i];
        }
        return res;
    }
    static int getAND(int[] array)
    {
        int res = array[0];
        for(int i = 1;i<array.length;i++)
        {
            res &= array[i];
        }
        return res;
    }
    static int getCosts(int[] array)
    {
        return (getOR(array)-getAND(array)) - (getMax(array)-getMin(array));
    }
    static int getSize(int r, int l)
    {
        return (r-l+1);
    }
    static String getString(int[] A)
    {
        String s = "[";
        for(int i = 0;i<A.length;i++)
        {
            s = s+A[i]+",";
        }
        s = s.substring(0,s.length()-1);
        s = s+"]";
        return s;
    }
    static int[] costlyIntervals(int n, int k, int[] A) {
        int[] toreturn = new int[n];
        
        for(int i = 0;i<n;i++)
        {
            int largest = -1;
           // Return a list of length n consisting of the answers
           for(int l = 0;l<A.length;l++)
            {
               for(int r = l;r<A.length;r++)
                {
                    int[] subarray = new int[r-l+1];
                    int o = 0;
                    for(int z = l;z<=r;z++)
                    {  
                        subarray[o] = A[z];
                        o++;
                    }
                
                   int real_i = i+1;
                   int real_l = l+1;
                   int real_r = r+1;
                   
                   if(real_l<=real_i&&real_i<=real_r)
                   {
                    int cost = getCosts(subarray);
                       if(cost>=k)
                       {
                            int size = getSize(real_r,real_l);
                           if(size>largest)
                           {
                               largest = size;
                           }
                       }
                   }
                }
            }
            toreturn[i] = largest;
        }

        return toreturn;
    }

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