#include <bits/stdc++.h>

using i64 = long long;

constexpr int Base = 1145141;
constexpr int P = 998244353;

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<std::set<i64>> s(n);
    for(int i = 0; i < n; i ++ ) {
        std::vector<bool> vis(n + 1);
        i64 h = 0, cnt = -1;
        for(int j = i; j >= 0; j -- ) {
            if(not vis[a[j]]) {
                vis[a[j]] = true;
                cnt += 1;
                h = (h * Base + a[j]) % P;
                s[cnt].insert(h);
            }
        }
    }

    auto calc = [&](std::deque<int> q) -> i64 {
        i64 h = 0;
        while(q.size()) {
            h = (h * Base + q.front()) % P;
            q.pop_front();
        }
        return h;
    };
    
    std::set<i64> R;
    std::deque<int> Q;
    std::vector<bool> have(n + 1);
    for(int i = 0; i < n; i ++ ) {
        if(not have[a[i]]) {
            have[a[i]] = true;
            Q.push_front(a[i]);
        } else {
            std::deque<int> r;
            while(Q.front() != a[i]) {
                r.push_back(Q.front());
                Q.pop_front();
            }
            Q.pop_front();
            while(r.size()) {
                Q.push_front(r.back());
                r.pop_back();
            }
            Q.push_front(a[i]);
        }
        R.insert(calc(Q));
    }
    
    while(q -- ) {
        int t;
        std::cin >> t;
        bool f = false;
        std::vector<int> ask;
        for(int i = 0; i < t; i ++ ) {
            int x;
            std::cin >> x;
            if(x) ask.push_back(x);
            else f = true;
        }

        i64 h = 0;
        for(auto x : ask) {
            h = (h * Base + x) % P;
        }
        if(f) {
            std::cout << (R.count(h) ? "Yes" : "No") << '\n';
        } else {
            std::cout << (s[t - 1].count(h) ? "Yes" : "No") << '\n';
        }
    }

}

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

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