//私は猫です
#include <bits/stdc++.h>
using namespace std;
#define int long long
int read(){
    int xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())
        xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
int n, m, ans[214514];
vector <int> e[214514];
void solve(){
    n = read(), m = read();
    for (int i = 1, k, a; i <= n; ++i){
        e[i].clear();
        k = read(); ans[i] = i;
        while(k--)e[i].push_back(read());
        sort(e[i].begin(), e[i].end());
    }
    // for (int i = 1; i <= n; ++i){
    //     for (int v : e[i])cout<<v<<" ";cout<<endl;
    // }
    bool fl, fll = false;
    for (int i = 2; i <= n; ++i){
        fl = true;
        for (int j = 0, k = 0; j < e[i].size(); ++j){
            while(k < e[i - 1].size() && e[i - 1][k] < e[i][j])++k;
            if (e[i - 1][k] == e[i][j]){
                fl = false; break;
            }
        }
        if (fl){
            fll = true;
            swap(ans[i - 1], ans[i]); break;
        }
    }
    if (fll){
        printf("Yes\n");
        for (int i = 1; i <= n; ++i)printf("%lld ", ans[i]); printf("\n");
    }
    else printf("No\n");
}
signed main(){
    int _ = read();
    while(_--)solve();
    return 0;
}