#include<bits/stdc++.h>

using ll = long long;
using ld = long double;

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

    std::vector<int> p(n);
    std::vector<std::vector<int>> b(m + 1);

    for (int i = 0; i < n; i++) {
        std::cin >> p[i];
        std::set<int> s;
        for (int j = 0; j < p[i]; j++) {
            int x;
            std::cin >> x;
            s.insert(x);
        }
        p[i] = s.size();
        for (auto x: s) {
            b[x].push_back(i);
        }
    }

    std::vector<int> d(n);
    std::vector<std::vector<int>> g(n);
    for (int i = 1; i <= m; i++) {
        if (b[i].empty()) {
            continue;
        }
        int x = b[i].back();
        for (int j = 0; j + 1 < b[i].size(); j++) {
            g[b[i][j]].push_back(x);
            d[x]++;
        }
    }

    std::queue<int> q;
    for (int i = 0; i < n; i++) {
        if (d[i] == 0) {
            q.push(i);
        }
    }

    std::vector<int> ans;
    while (q.size()) {
        auto u = q.front();
        q.pop();
        ans.push_back(u);
        for (auto v: g[u]) {
            d[v]--;
            if (d[v] == 0) {
                q.push(v);
            }
        }
    }

    for (int i = 0; i < n; i++) {
        if (d[i] != 0) {
            std::cout << "No\n";
            return;
        }
    }

    bool flag = false;
    for (int i = 0; i < n; ++i) {
        if (ans[i] != i)
            flag = true;
    }

    if (!flag) {
        std::cout << "No\n";
        return;
    }

    std::cout << "Yes\n";
    for (auto i: ans) {
        std::cout << i + 1 << " ";
    }
    std::cout << "\n";
}

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

    int tCase = 1;
    std::cin >> tCase;
    for (int i = 1; i <= tCase; ++i) {
        solve(tCase);
    }
    return 0;
}