subarray bits

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define OO 2'000'000'000
#define ull unsigned long long
#define nl '\n'
#define sz(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>


void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.out", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}




int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };




void solve(){
  ll n,x,a,o;
  cin>>n>>x>>a>>o;

    vector<ll> v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    ll len = -1;




    vector<ll> freqbits(64),freqbits2(64);
    ll XOR = 0,OR = 0,AND = v[0];
    ll l=0,r=0;
    for(;r<n;r++){
        for(int i=0;i<64;i++){
            if(v[r]&(1LL<<i)){
                freqbits[i]++;
            }else freqbits2[i]++;
        }
        XOR^=v[r];
        OR|=v[r];
        AND&=v[r];
        // cout<<l<<" "<<r<<nl;
        // cout<<XOR<<" "<<OR<<" "<<AND<<nl;

        while(l<r and (XOR>x or OR>o or AND>a)){
            for(int i=0;i<64;i++){
                if(v[l]&1LL<<i){
                    if(freqbits[i]&1){
                        XOR^=(1LL<<i);
                    }
                    if(freqbits[i]==1){
                        OR^=(1LL<<i);
                    }
                    freqbits[i]--;
                }else{
                    if(freqbits2[i]==1){
                        AND^=(1LL<<i);
                    }
                    freqbits2[i]--;
                }
            }
            l++;
        }
        // cout<<l<<" "<<r<<nl;
        // cout<<XOR<<" "<<OR<<" "<<AND<<nl;

        // find the xor , or , and of every pair in this range



        if(XOR<=x and OR<=o and AND<=a){
            // cout<<l<<' '<<r<<nl;
            // cout<<XOR<<" "<<OR<<" "<<AND<<nl;
            len = max(len,r-l+1);
        }

    }
    cout<<len<<nl;




}

int main(){
    Fast_IO();
int t =1;
cin>>t;
while(t--){
solve();
}
return 0;
}