#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int BK = 100003;
const ull MOD = (1ll << 61) - 1;
const int BASE = 1445;
const int N = 5010;
int Case, n, q;
vector<pair<ull, int>> g[BK];
int a[N];
inline ull Mul(ull a, ull b) {
    return (__int128)a * b % MOD;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> Case;
    while (Case--) {
        cin >> n >> q;
        vector<int> clr;
        vector<bool> ans(q + 1);
        for (int i = 1; i <= n; ++i) cin >> a[i];
        for (int i = 1, k, x; i <= q; ++i) {
            cin >> k;
            int bkid = 0;
            ull hs = 0;
            for (int j = 1, x, la = -1; j <= k; ++j) {
                cin >> x;
                if (x || la) {
                    bkid = (1ll * bkid * BASE + x + 1) % BK;
                    hs = (Mul(hs, BASE) + x + 1) % MOD;
                }
                la = x;
            }
            if (bkid == 1 && hs == 1) ans[i] = 1;
            g[bkid].push_back({hs, i});
            clr.push_back(bkid);
        }
        vector<int> buf(1, 0);
        for (int t = 1; t <= n; ++t) {
            auto it = find(buf.begin(), buf.end(), a[t]);
            if (it == buf.end()) { buf.insert(buf.begin(), a[t]); }
            else { buf.erase(it); buf.insert(buf.begin(), a[t]); }
            int bkid = 0;
            ull hs = 0;
            for (auto x : buf) {
                bkid = (1ll * bkid * BASE + x + 1) % BK;
                hs = (Mul(hs, BASE) + x + 1) % MOD;
                for (auto [hsval, id] : g[bkid]) if (hsval == hs) ans[id] = 1;
            }
        } 
        for (int i = 1; i <= q; ++i) cout << (ans[i] ? "Yes" : "No") << '\n';
        for (auto x : clr) g[x].clear();
    }
    return 0;
}