#pragma GCC optimize("O3,unroll-loops,inline,fast-math")

#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;

//#define int long long
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

constexpr int mod = 1e9 + 4099, p = 6661;

vector<int> fl[5001], pref[5001];

void solve() {
    int n, q;
    cin >> n >> q;
    deque<int> a;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        if (find(all(a), x) != a.end()) a.erase(find(all(a), x));
        a.push_front(x);
        int curhash = 0;
        for (int j = 1; j <= a.size(); ++j) {
            curhash = 1ll * curhash * p % mod;
            curhash += a[j - 1];
            if (curhash >= mod)
                curhash -= mod;
            pref[j].push_back(curhash);
        }
        fl[a.size()].push_back(curhash);
    }
    fl[0].push_back(0);
    pref[0].push_back(0);
    for (int i = 0; i <= n; ++i)
        sort(all(fl[i])), sort(all(pref[i])), fl[i].push_back(mod), pref[i].push_back(mod);
    for (int i = 0; i < q; ++i) {
        int m;
        cin >> m;
        vector<int> x;
        int curhash = 0;
        for (int j = 0; j < m; ++j) {
            int lol;
            cin >> lol;
            if (lol) x.push_back(lol);
        }
        for (auto e: x) {
            curhash = 1ll * curhash * p % mod;
            curhash += e;
            if (curhash >= mod)
                curhash -= mod;
        }
        string ans = "No\n";
        if (x.size() == m) {
            if (*lower_bound(pref[m].begin(), pref[m].end(), curhash) == curhash) ans = "Yes\n";
        } else {
            if (*lower_bound(fl[x.size()].begin(), fl[x.size()].end(), curhash) == curhash) ans = "Yes\n";
        }
        cout << ans;
    }
    for (int i = 0; i <= n; ++i)
        fl[i].clear(), pref[i].clear();
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)
        solve();
}