#include<cstdio>

#include<iostream>

#include<cstring>

#include<vector>

#include<algorithm>

using namespace std;

typedef long long ll;

const int BASE=;

ll b[];

int n,cnt;

vector<ll>mp;

ll query(ll k){

    if(cnt!=n)k--;

    if(k>(1LL<<(int)mp.size())-)return -;

    ll ans=;

    for(int i=;i<(int)mp.size();i++){

    if(k>>i&)ans^=mp[i];

    }

    return ans;

}

inline void init(){

    cnt=;

    memset(b,,sizeof(b));

    mp.clear();

}

int main(){

    int t;

    scanf("%d",&t);

    for(int cas=;cas<=t;cas++){

    printf("Case #%d:\n",cas);

    scanf("%d",&n);

    init();

    for(int i=;i<=n;i++){

        ll a;scanf("%lld",&a);

        for(int j=BASE;j>=;j--){

        if(a>>j&){

            if(b[j])a^=b[j];

            else{

            b[j]=a;cnt++;

            for(int k=j-;k>=;k--)

                if(b[k]&&(b[j]>>k&))b[j]^=b[k];

            for(int k=j+;k<=BASE;k++)

                if(b[k]>>j&)b[k]^=b[j];

            break;

            }

        }

        }

    }

    for(int i=;i<=BASE;i++)

        if(b[i])mp.push_back(b[i]);

    int q;

    scanf("%d",&q);

    while(q--){

        ll k;

        scanf("%lld",&k);

        printf("%lld\n",query(k));

    }

    }

    return ;

}