#include <bits/stdc++.h>

using i64 = long long;
#define int i64

bool isprime(int n) {
    if (n <= 1) {
        return false;
    }
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

int findPrime(int n) {
    while (!isprime(n)) {
        n++;
    }
    return n;
}

std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());

const int P = findPrime(rng() % 900000000 + 100000000);
const int Base = findPrime(rng() % 8000000 + 10000000);

void solve() {
    int n, q;
    std::cin >> n >> q;

    std::vector<i64> h(n + 1), a(n);
    for(int i = 0; i < n; i ++ ) {
        std::cin >> a[i];
    }

    std::vector<bool> ans(q);
    std::unordered_map<int, std::vector<int>> q1, q2;
    for(int i = 0; i < q; i ++ ) {
        int t;
        std::cin >> t;

        i64 h = 0, f = true, cnt = 0;
        while(t -- ){
            int x;
            std::cin >> x;
            if(x) h = (h * Base + x) % P, cnt ++;
            else f = false;
        }
        assert(cnt > 0);
        if(not cnt) {
            ans[i] = true;
        } else if(f) {
            q1[h].push_back(i);
        } else {
            q2[h].push_back(i);
        }
    }

    for(int i = 0; i < n; i ++ ) {
        std::vector<bool> vis(n + 1);
        i64 h = 0;
        for(int j = i; j >= 0; j -- ) {
            if(not vis[a[j]]) {
                vis[a[j]] = true;
                h = (h * Base + a[j]) % P;
                if(q1.count(h)) {
                    for(auto x : q1[h]) {
                        ans[x] = true;
                    }
                    q1.erase(h);
                }
            }
        }
        if(q2.count(h)) {
            for(auto x : q2[h]) {
                ans[x] = true;
            }
            q2.erase(h);
        }
    }

    for(int i = 0; i < q; i ++ ) {
        std::cout << (ans[i] ? "Yes" : "No") << '\n';
    }

}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int T = 1;
    std::cin >> T;
    while(T -- ) {
        solve();
    }
    return 0;
}