#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
const ll N = 100010;
vector<ll> edge[N], p[N];
ll teg[N];

void solve(){
    ll n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++){
        edge[i].clear();
        p[i].clear();
        teg[i] = 0;
    } 

    for(int i = 1; i <= n; i ++){
        ll siz;
        cin >> siz;
        for(int j = 1; j <= siz; j ++){
            ll x;
            cin >> x;
            p[x].push_back(i);
        }
    }

    for(int i = 1; i <= n; i ++){
        for(int j = 0; j < p[i].size() - 1; j ++){
            edge[p[i][j]].push_back(p[i].back());
            teg[p[i].back()] ++;
        }
    }
    vector<ll> ans(n + 10);
    ll sum = 0, now = 0;
    for(int i = n; i >= 1; i --){
        if(teg[i] != 0) continue;
        priority_queue<ll> q;
        q.push(i);
        while(q.size()){
            auto u = q.top();
            q.pop();
            ans[++ now] = u;
            for(auto v : edge[u]){
                if(-- teg[v] == 0) q.push(v);
            }
        }
    }
    bool ok = 1;
    for(int i = 1; i <= n; i ++){
        if(ans[i] != i){
            ok = 0;
            break;
        }
    }
    if(ok){
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for(int i = 1; i <= n; i ++){
        cout << ans[i] << " \n"[i == n];
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    cin >> t;
    while(t --){
        solve();
    }
    return 0;
}