#include <bits/stdc++.h>

#define ll long long

struct DSU {
    std::vector<int> f, siz;
 
    DSU() {}
    DSU(int n) {
        init(++n);
    }
 
    void init(int n) {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }
 
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
 
    bool same(int x, int y) {
        return find(x) == find(y);
    }
 
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
 
    int size(int x) {
        return siz[find(x)];
    }
};


void solve(){
    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<int>> change(m);
    std::vector<std::vector<int>> b(n);
    std::vector<int> lst(m, -1);
    DSU d(m);
    for (int i = 0; i < n; i++){
        int p;
        std::cin >> p;
        b[i].resize(p);
        for (int j = 0; j < p; j++){
            std::cin >> b[i][j];
            b[i][j]--;
            change[b[i][j]].push_back(i);
            lst[b[i][j]] = i;
            if (j){
                d.merge(b[i][j], b[i][j - 1]);
            }
        }
    }   

    std::vector<int> ans(n), use(n), un;
    std::iota(ans.begin(), ans.end(), 0);
    for (int i = 0; i < m; i++){
        if (lst[i] != -1){
            use[lst[i]] = 1;
        }
    }
    for (int i = 0; i < n; i++){
        if (use[i] == 0){
            un.push_back(i);
        }
    }
    if (un.size() >= 2){
        std::swap(ans[un[0]], ans[un[1]]);
        std::cout <<  "Yes\n";
        for (int i = 0; i < n; i++){
            std::cout << ans[i] + 1 << " \n"[i == n - 1];
        }
        return;
    }
    std::set<int> q;
    for (int i = 0; i < m; i++){
        if (lst[d.find(i)] != -1){
            q.insert(lst[d.find(i)]);
        }
    }
    if (q.size() < 2){
        std::cout << "No\n";
        return;
    }
    std::cout << "Yes\n";
    std::swap(ans[*q.begin()], ans[*(std::next(q.begin()))]);
    for (int i = 0; i < n; i++){
        std::cout << ans[i] + 1 << " \n"[i == n - 1];
    }


}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;

    std::cin >> t;

    while (t--){
        solve();
    }

    return 0;
}