#include <iostream>

#include <cstring>

#include <cstdio>

#include <vector>

using namespace std;

const int maxn = ;

int t;

int k, s;

int flag;

int p, n;

int vis[maxn];

int match[maxn];

vector<int> g[maxn];

void init() {

    flag = ;

    memset(match, -, sizeof(match));

    for(int i = ; i <= p+n; i++) g[i].clear();

}

bool dfs(int u) {

    vis[u] = ;

    for(int i = ; i < g[u].size(); i++) {

        int v = g[u][i], w = match[v];

        if(w< || !vis[w]&&dfs(w)) {

            match[u] = v;

            match[v] = u;

            return true;

        }

    }

    return false;

}

int hungarian() {

    int res = ;

    for(int u = ; u <= s+p; u++) {

        if(match[u] < ) {

            memset(vis, , sizeof(vis));

            if(dfs(u)) res++;

        }

    }

    return res;

}

int main() {

    scanf("%d", &t);

    while(t--) {

        init();

        scanf("%d%d", &p, &n);

        for(int i = ; i <= p; i++) {

            scanf("%d", &k);

            if(!k) flag = ;

            while(k--) {

                scanf("%d", &s);

                g[i].push_back(s+p);

                g[s+p].push_back(i);

            }

        }

        if(flag || n<p) {

            puts("NO");

            continue;

        }

        int ans = hungarian();

        if(ans == p) puts("YES");

        else puts("NO");

    }

}