#include <bits/stdc++.h>

const int N = 100100;

int m, n;

std::vector<int> pos[N];

int tot, head[N], ver[N], Next[N], deg[N];
void add_edge(int u, int v) {
    ver[++ tot] = v;    Next[tot] = head[u];    head[u] = tot;    deg[v] ++;
}

int anslen, ans[N];

void work() {
    scanf("%d%d", &m, &n);

    for (int i = 1; i <= n; i ++) pos[i].clear();

    for (int i = 1; i <= m; i ++) {
        int cnt;
        scanf("%d", &cnt);

        while (cnt --) {
            int x;
            scanf("%d", &x);

            pos[x].push_back(i);
        }
    }
    
    tot = 0;
    for (int i = 1; i <= m; i ++) head[i] = 0;
    for (int i = 1; i <= m; i ++) deg[i] = 0;

    for (int i = 1; i <= n; i ++) {
        int L = (int)pos[i].size();
        for (int x = 0; x < L - 1; x ++) add_edge(pos[i][L - 1], pos[i][x]);
    }

    std::queue<int> q;
    for (int i = 1; i <= m; i ++)
        if (deg[i] == 0) q.push(i);
    
    anslen = 0;
    while (q.size()) {
        int u = q.front(); q.pop();
        ans[++ anslen] = u;

        for (int i = head[u]; i; i = Next[i]) {
            int v = ver[i];
            if (-- deg[v] == 0) q.push(v);
        }
    }

    if (anslen < m) {
        puts("No");
        return;
    }

    bool flag = 1;
    for (int i = m; i >= 1; i --)
        if (ans[i] != m - i + 1) {
            flag = 0;
            break;
        }

    if (flag) {
        puts("No");
        return;
    }

    puts("Yes");
    for (int i = m; i >= 1; i --) printf("%d ", ans[i]);
    puts("");
}

int main() {
    int T;
    scanf("%d", &T);

    while (T --)
        work();
    
    return 0;
}