#include<bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    while (tests--) {
        int n, q;
        cin >> n >> q;
        vector<int> a(n, 0);
        vector<vector<int>> b;
        for (int i = 0; i < n; ++i) {
            int x;
            cin >> x;
            int k = find(a.begin(), a.end(), x) - a.begin();
            if (k < a.size()) {
                a.erase(a.begin() + k);
            } else {
                a.pop_back();
            }
            a.insert(a.begin(), x);
            b.push_back(a);
        }
        vector<int> p(n);
        iota(p.begin(), p.end(), 0);
        for (int i = n - 1; i >= 0; --i) {
            vector<int> cnt(n + 1);
            for (int j = 0; j < n; ++j) {
                cnt[b[j][i]]++;
            }
            for (int j = 1; j <= n; ++j) cnt[j] += cnt[j - 1];
            vector<int> pn(n);
            for (int j = n - 1; j >= 0; --j) {
                pn[--cnt[b[p[j]][i]]] = p[j];
            }
            swap(p, pn);
        }
        while (q--) {
            int m;
            cin >> m;
            vector<int> x(m);
            for (auto& i : x) cin >> i;
            while (x.back() == 0) x.pop_back();
            int L = 0, R = n - 1;
            while (L != R) {
                int M = (L + R) / 2 + 1;
                if (vector(b[p[M]].begin(), b[p[M]].begin() + x.size()) <= x) L = M;
                else R = M - 1;
            }
            if (vector(b[p[L]].begin(), b[p[L]].begin() + x.size()) == x) cout << "Yes\n";
            else cout << "No\n";
        }
    }
}