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

vector<int> adj[100001];
void sol() {
    int N, M;
    cin >> N >> M;
    for (int i = 1;i <= N;i ++ ) 
        adj[i].clear();
    vector<int> f(M + 1);
    vector<vector<int> > G(M + 1); 
    for (int i = 1;i <= N;i ++ ) {
        int p;cin >> p;
        while (p -- ) {
            int x;cin >> x;
            f[x] = i, G[x].push_back(i);
        }
    }
    vector<int> d(N + 1);
    set<pair<int, int>> mp;
    for (int i = 1;i <= M;i ++ ) {
        for (auto x : G[i]) {
            if (x == f[i]) continue;
            if (mp.count({f[i], x})) continue;
            mp.insert({f[i], x});
            adj[f[i]].push_back(x);
            ++ d[x];
        }
    }
    queue<int> q;
    for (int i = 1;i <= N;i ++ ) 
        if (!d[i]) q.push(i);
    int sz = 0;
    vector<int> ans;
    while (q.size()) {
        int u = q.front();
        q.pop();
        ++ sz;
        ans.push_back(u);
        vector<int> tmp;
        for (auto x : adj[u]) {
            if (-- d[x] == 0) tmp.push_back(x);
        }
        for (int i = 0;i < tmp.size();i ++ ) 
            if (tmp[i] != ans.back() - 1) {
                swap(tmp[i], tmp[0]);
                break;
            }
        for (auto x : tmp) q.push(x);
    }
    if (sz != N) cout << "No\n";
    else {
        reverse(ans.begin(), ans.end());
        bool suc = true;
        vector<int> res;
        for (int i = 1;i <= N;i ++ ) 
            res.push_back(i);
        if (ans == res) cout << "No\n";
        else {
            cout << "Yes\n";
            for (auto x : ans) cout << x << " ";
            cout << '\n';
        }
    }
} 

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t;cin >> t;
    while (t -- ) {
        sol();
    }
}