#include <bits/stdc++.h>
using namespace std;
 
 
/*
------------------------Input Checker----------------------------------
*/
 
long long readInt(long long l,long long r,char endd){
    long long x=0;
    int cnt=0;
    int fi=-1;
    bool is_neg=false;
    while(true){
        char g=getchar();
        if(g=='-'){
            assert(fi==-1);
            is_neg=true;
            continue;
        }
        if('0'<=g && g<='9'){
            x*=10;
            x+=g-'0';
            if(cnt==0){
                fi=g-'0';
            }
            cnt++;
            assert(fi!=0 || cnt==1);
            assert(fi!=0 || is_neg==false);
 
            assert(!(cnt>19 || ( cnt==19 && fi>1) ));
        } else if(g==endd){
            if(is_neg){
                x= -x;
            }
 
            if(!(l <= x && x <= r))
            {
                cerr << l << ' ' << r << ' ' << x << '\n';
                assert(1 == 0);
            }
 
            return x;
        } else {
            assert(false);
        }
    }
}
string readString(int l,int r,char endd){
    string ret="";
    int cnt=0;
    while(true){
        char g=getchar();
        assert(g!=-1);
        if(g==endd){
            break;
        }
        cnt++;
        ret+=g;
    }
    assert(l<=cnt && cnt<=r);
    return ret;
}
long long readIntSp(long long l,long long r){
    return readInt(l,r,' ');
}
long long readIntLn(long long l,long long r){
    return readInt(l,r,'\n');
}
string readStringLn(int l,int r){
    return readString(l,r,'\n');
}
string readStringSp(int l,int r){
    return readString(l,r,' ');
}
 
 
/*
------------------------Main code starts here----------------------------------
*/
 
const int MAX_T = 1e5;
const int MAX_N = 1e5;
const int MAX_SUM_LEN = 1e5;
 
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep_a(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
 
int sum_n = 0, sum_m = 0, sum = 0;
int max_n = 0, max_m = 0;
int yess = 0;
int nos = 0;
int total_ops = 0;
ll mod = 1000000007;




void solve()
{   
   int n = readIntSp(1,2e5);
   int q = readIntLn(1,2e5);

   int a[n];
   rep(i,n){
    if(i<n-1) a[i] = readIntSp(0, (1<<20)-1);
    else a[i] = readIntLn(0, (1<<20)-1);
   }


   vector<int> submsk_cnt(1<<20,0);

   rep(i,n) submsk_cnt[a[i]]++;

   rep(i,20){
    rep(j, 1<<20){
        if((j>>i)&1) submsk_cnt[j]+=submsk_cnt[j^(1<<i)];
    }
   }



   rep(i,q){
    int x = readIntSp(0, (1<<20)-1);
    int m = readIntLn(0, 2e5);

    sum_m += m;
    int fxd = 0;

    if(m){
        int prv = -1, b;

        rep(j,m){
            if(j<m-1) b = readIntSp(1,n);
            else b = readIntLn(1,n);

            assert(b>prv);
            prv=b;
            b--;
            fxd|=a[b];
        }
    }
    
    int ans = -1;
    int cur = 0;
    rev(i,19){
        if((x>>i)&1){
            int chk = cur^((1<<i)-1);
            if((chk&fxd)==fxd) ans = max(ans, submsk_cnt[chk]);
            cur^=(1<<i);
        }
    }

    if((x&fxd)==fxd) ans = max(ans, submsk_cnt[x]);
    if(ans==-1) nos++;
    else yess++;
    cout<<ans<<'\n';

   }
}
 
signed main()
{

    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r" , stdin);
    freopen("output.txt", "w" , stdout);
    #endif
    fast;
    
    int t = 1;
    
   // t = readIntLn(1,100);
    
    for(int i=1;i<=t;i++)
    {    
       solve();
    }
   
    assert(getchar() == -1);
    assert(sum_m<=2e5);
 
    cerr<<"SUCCESS\n";
    cerr<<"Tests : " << t << '\n';
    cerr<<"Sum of lengths : " << sum_m <<'\n';
    cerr<<"Maximum length : " << max_n <<'\n';
    // cerr<<"Total operations : " << total_ops << '\n';
    cerr<<"Answered yes : " << yess << '\n';
    cerr<<"Answered no : " << nos << '\n';

    cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
}