#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 = 19260817;
const ll mo2 = 1e9 + 87;
const ll P = 131;
const ll Q = 13331;
ll f, g, pp[N], qq[N], y[N];
pi u[N];
queue<int>q[2];
map<pi, bool> h[N], t[N];
int n, k;
int a[N], b[N];
int tmp, len;
bool all[N];
void work() {
    if (h[len].find(mk(f, g)) != h[len].end()) t[len][mk(f, g)] = 1;
}
void solve() {
    cin >> n >> k;
    fo(i, 1, n) h[i].clear(), t[i].clear(), all[i] = 1;

    fo(i, 1, n)cin >> a[i];

    ll l, x;
    fo(i, 1, k) {
        cin >> l;
        f = g = 0;

        fo(j, 1, l) {
            cin >> x;
            if (x)all[i] = 0;

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

        h[l][mk(f, g)] = 1;
        u[i] = mk(f, g);
        y[i] = l;
    }


    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;

        work();

        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;

            work();

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

        }

    }

    fo(i, 1, k) if (t[y[i]].find(u[i]) != t[y[i]].end() || all[i]) cout << "Yes" << "\n"; else cout << "No" << "\n";
}
int main() {

    // freopen("data.in", "r", stdin);
    // freopen("data.out", "w", stdout);

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