#include<bits/stdc++.h>
#define ll long long
#define db long double
#define mk make_pair
#define eb emplace_back 
#define pi pair<ll,ll>
#define fo(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++)
#define fd(i,a,b) for(ll (i)=(a);(i)>=(b);(i)--)
using namespace std;
const int N=1e5+10;
const ll mo1=1e9+7;
const ll mo2=1e9+9;
const ll P=131;
const ll Q=13331;
ll f,g,pp[N],qq[N];
queue<int>q[2];
map<pi,bool> h[N];
int n,k;
int a[N];
int tmp,len;
void solve(){
    cin>>n>>k;
    fo(i,1,n) h[i].clear();

    fo(i,1,n)cin>>a[i];
    while(!q[0].empty())q[0].pop();
    while(!q[1].empty())q[1].pop();
    fo(i,1,n)q[0].push(0);
    fo(i,1,n)
    {
        while(!q[(i)%2].empty())q[(i)%2].pop();
        q[i%2].push(a[i]);
        tmp=a[i];
        len=1;

        f=tmp+1;
        g=tmp+1;

        h[len][mk(f,g)]=1;

        if(len==n) {
            continue;
        }
        while(!q[(i+1)%2].empty())
        {
            tmp=q[(i+1)%2].front();
            q[(i+1)%2].pop();
            if(tmp==a[i])continue;
            q[i%2].push(tmp);
            len++;

            f=(f*P%mo1+(tmp+1))%mo1;
            g=(g*Q%mo2+(tmp+1))%mo2;

            h[len][mk(f,g)]=1;

            if(len==n)break;
            //tmp len

        }

    }

    ll l,x;
    while (k--) {
        cin>>l;
        f=g=0;
        fo(i,1,l) {
            cin>>x;
            
            f=(f*P%mo1+(x+1))%mo1;
            g=(g*Q%mo2+(x+1))%mo2;
        }

        if (h[l].find(mk(f,g))!=h[l].end()) cout<<"Yes"<<"\n";
        else cout<<"No"<<"\n";
    }
}
int main(){

    pp[0]=qq[0]=1;
    
    fo(i,1,5005) {
        pp[i]=pp[i-1]*P%mo1;
        qq[i]=qq[i-1]*Q%mo2;
    }

    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T=1;
    cin>>T;
    while(T--) solve();
    return 0;
}