#include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
int n, m, a[MAXN], in[MAXN], ans[MAXN];
vector<int> e[MAXN];
void push(int x, int y){
    e[x].push_back(y);
    in[y]++;
}
void work(){
    scanf("%d%d", &n, &m);
    int k, x;
    for(int i=1;i<=n;i++){
        scanf("%d", &k);
        for(int j=1;j<=k;j++) {
            scanf("%d", &x);
            if(a[x] && a[x] != i) push(a[x], i);
            a[x] = i;
        }
    }
    priority_queue<int> q;
    for(int i=1;i<=n;i++) if(!in[i]) q.push(i);
    int cnt = 0;
    while(!q.empty()){
        int x = q.top();
        q.pop();
        ans[++cnt] = x;
        for(auto v : e[x]){
            in[v]--;
            if(!in[v]) q.push(v);
        }
    }
    bool flag = true;
    for(int i=1;i<=n;i++) flag &= ans[i] == i;
    if(flag) puts("No");
    else {
        puts("Yes");
        for(int i=1;i<=n;i++) printf("%d ", ans[i]);
        puts("");
    }
    for(int i=1;i<=m;i++) e[i].clear(), in[i] = 0, ans[i] = 0, a[i] = 0;
}
int main(){
    int t;
    cin>>t;
    while(t--) work();
    return 0;
}