#include<iostream>
#include<queue>
#include<cstdio>
using namespace std;

priority_queue<int> q;
struct node {
    int to, nxt;
} e[40000006];
int cnt, head[100005];
void add(int x, int y) {
    e[++cnt].to = y;
    e[cnt].nxt = head[x];
    head[x] = cnt;
}

int bu[100005], rd[100005], vis[100005];

int main() {
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        for (int i = 1; i <= n; i++) {
            int p;
            cin >> p;
            for (int j = 1; j <= p; j++) {
                int l;
                cin >> l;
                if (bu[l] == 0) {
                    bu[l] = i;
                } else if (vis[bu[l]] == 0 && bu[l] != 0) {
                    add(bu[l], i);
                    rd[i]++;
                    vis[bu[l]] = 1;
                    bu[l] = i;
                }
            }
            for (int j = 1; j <= p; j++)
                vis[j] = 0;  // 清零 vis
        }

        int pd = 0;
        for (int i = 1; i <= n; i++) {
            if (rd[i] == 0) q.push(i);
        }

        int ans[100005], tot = 0;
        while (!q.empty()) {
            int x = q.top();
            q.pop();
            ans[++tot] = x;
            if (tot != x) pd = 1;
            for (int i = head[x]; i != 0; i = e[i].nxt) {
                int y = e[i].to;
                rd[y]--;
                if (rd[y] == 0) q.push(y);
            }
        }

        if (pd == 0) {
            cout << "No" << endl;
        } else {
            cout << "Yes" << endl;
            for (int i = 1; i < tot; i++)
                cout << ans[i] << " ";
            cout << ans[tot] << endl; // 确保最后一项不带多余空格
        }

        for (int i = 1; i <= n; i++)
            bu[i] = rd[i] = head[i] = 0;
        cnt = 0;
    }
    
    return 0;
}