#include <bits/stdc++.h>

#define OobugoO_IOS std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
#define x first
#define y second

typedef long long ll;

void solve() {
    int n, m;
    std::cin >> n >> m;
    std::vector<std::set<int>> a(n + 1, std::set<int>());
    std::vector<int> ans(n + 1);
    for (int i = 1; i <= n; i++) ans[i] = i;
    for (int i = 1; i <= n; i++) {
        int j; std::cin >> j;
        while (j--) {
            int x;  std::cin >> x;
            a[i].insert(x);
        }
    }
    bool f = false;
    for (int i = 2; i <= n; i++) {
        bool ok = true;
        for (auto x : a[i]) {
            if (a[i - 1].find(x) != a[i - 1].end()) {
                ok = false;
                break;
            }
        }
        if (ok) {
            f = true;
            std::swap(ans[i], ans[i - 1]);
        }
    }
    if (f) {
        std::cout << "Yes\n";
        for (int i = 1; i <= n; i++)
            std::cout << ans[i] << " \n"[i == n];
    } else {
        std::cout << "No\n";
    }
}
int main() {
    OobugoO_IOS;

#ifdef Onlion_Judge
    freopen("IO/input.in", "r", stdin);
    freopen("IO/output.out", "w", stdout);
#endif
    
    int t = 1;  std::cin >> t;
    while (t--)
        solve();
}