#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
const int p=2000223479;
int a[5005],loc[5005];
int ans[5005];
vector<pii>qr[5005];
vector<pii>qre;
void solve(){
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        qr[i].clear();
        loc[i]=-1;
    }
    qre.clear();
    for(int i=1;i<=q;i++){
        ans[i]=0;
        int len;
        cin>>len;
        vector<int>s;
        for(int j=1;j<=len;j++){
            int x;
            cin>>x;
            s.push_back(x);
        }
        int flag=0;
        if(s.back()==0){
            flag=1;
            while(s.size()&&s.back()==0)s.pop_back();
            if(s.empty())ans[i]=1;
        }
        // reverse(s.begin(),s.end());
        ll h=0;
        for(auto u:s){
            h=(h*1373+u)%p;
        }
        if(flag){
            qre.push_back({h,i});
            continue;
        }
        qr[len].push_back({h,i});
    }
    for(int i=1;i<=n;i++){
        sort(qr[i].begin(),qr[i].end());
    }
    sort(qre.begin(),qre.end());
    vector<int>st;
    for(int i=1;i<=n;i++){
        if(loc[a[i]]==-1){
            loc[a[i]]=st.size();
            st.push_back(a[i]);
        }
        else{
            for(int j=0;j<st.size();j++){
                if(st[j]==a[i]){
                    st.erase(st.begin()+j);
                    break;
                }
            }
            st.push_back(a[i]);
        }
        ll h=0;
        int len=0;
        for(int i=st.size()-1;i>=0;i--){
            h=(h*1373+st[i])%p;
            len++;
            if(qr[len].empty())continue;
            int loc=lower_bound(qr[len].begin(),qr[len].end(),pair<int,int>{h,0})-qr[len].begin();
            if(loc==qr[len].size())continue;
            while(loc<qr[len].size()&&qr[len][loc].first==h){
                ans[qr[len][loc].second]=1;
                qr[len].erase(qr[len].begin()+loc);
            }
        }
        int loc=lower_bound(qre.begin(),qre.end(),pair<int,int>{h,0})-qre.begin();
        if(loc==qre.size())continue;
        while(loc<qre.size()&&qre[loc].first==h){
            ans[qre[loc].second]=1;
            qre.erase(qre.begin()+loc);
        }
    }
    for(int i=1;i<=q;i++){
        if(ans[i])cout<<"Yes\n";
        else cout<<"No\n";
    }
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)solve();
    return 0;
}
/*

*/