#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)

using namespace std;

int solve(vector<int> v, int k, int bit) {
    if (bit == -1) return v.size();
    vector<int> v0, v1;
    for (int x : v) {
        if (x & (1 << bit)) v1.push_back(x);
        else v0.push_back(x);
    }
    if (k & (1 << bit)) {
        return max({(int)v0.size(), (int)v1.size(), solve(v, k, bit - 1)});
    }   
    else {
        return max(solve(v0, k, bit - 1), solve(v1, k, bit - 1));
    }
}


int bruteSolve(vector<int> v,int k){
    int n = v.size();
    int res=0;
    for(int msk=0;msk<(1<<n);msk++){
        int ok = 1;
        vector<int> here;
        rep(i,0,n)if(msk>>i&1){
            here.push_back(v[i]);
        }
        for(auto x : here)for(auto y : here){
            if((x^y) > k){
                ok = 0;
                break;
            }
        }
        if(ok)res = max(res,(int)here.size());
    }
    return res;
}


mt19937 rng(123);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    // cin >> t;
    t = 100;
    for(int tt =1 ; tt<=t; tt++){
        if(tt % 5==0){
            cout << tt << endl;
        }
        int n, k;
        // cin >> n >> k;
        n = rng()%4 + 1, k = rng()%8+1;
        vector<int> v(n);
        for (int &x : v) {
            // cin >> x;
            x = rng()%8;    
        }
        // cout << solve(v, k, 19) << '\n';
        if(solve(v,k,19) != bruteSolve(v, k)){
            cout << n<<" " << k << endl;
            for(auto x : v)cout << x<<" ";
            cout << endl;
            cout << bruteSolve(v,k) << " " << solve(v,k,19) << endl;
            break;
        }
    }
    return 0;
}