#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-10;
const int N = 100010;
const double PII = acos(-1);
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f;
// int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
// int dir[8][2] = {{1, 0}, {1, -1}, {1, 1}, {0, 1}, {0, -1}, {-1, 1}, {-1, 0}, {-1, -1}};
// std::mt19937 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

template <typename T>
void debug(T x) {
    cerr << x << '\n';
}

template <typename T, typename... Args>
void debug(T x, Args... args) {
    cerr << x << ' ';
    debug(args...);
}

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

    vector<int> a(m + 1);
    map<int, int> mp;
    vector<int> in(n + 1);
    vector<vector<int>> e(m + 1);
    for (int i = 1; i <= n; i ++ ) {
        int cnt; cin >> cnt;
        vector<int> tmp(cnt + 1);
        for (int j = 1; j <= cnt; j ++ ) {
            int x;
            cin >> x;
            tmp[j] = x;
            a[x] = i;
            e[x].push_back(i);
        }
    }

    if (n == 1) {
        cout << "No" << '\n';
        return ;
    }
    map<int, set<int>> g;
    for (int i = 1; i <= m; i ++ ) {
        if (e[i].size() > 1) {
            int tt = e[i].back();
            for (int j = 0; j < (int)e[i].size() - 1; j ++ ) {
                int t = g[e[i][j]].size();
                g[e[i][j]].insert(tt);
                if ((int)g[e[i][j]].size() == t + 1) {
                    in[tt] ++;
                }
            }
        }
    }
    unordered_map<int, int> ump;
    int cnt = 0;
    for (int i = 1; i <= m; i ++ ) {
        // if (a[i] && ump[a[i]] == 0) cnt ++;
        // if (a[i]) ump[a[i]] = 1;
        if (a[i] == 0) continue;
        if (ump[a[i]] == 0) cnt ++;
        ump[a[i]] = 1;
    }
    vector<int> ans;
    if (cnt < n) {
        for (int i = n; i >= 1; i -- ) {
            if (ump[i] == 0) {
                ans.push_back(i);
            } 
        }
        for (int i = 1; i <= n; i ++ ) {
            if (ump[i]) {
                ans.push_back(i);
            }
        }
        // if(n == 50000 && m == 100000) cout << "Yes1" << '\n';
        // else cout << "Yes" << '\n';
        cout << "Yes" << '\n';
        for (int i = 0; i < (int)ans.size(); i ++ ) {
            cout << ans[i] << " \n"[i == (int)ans.size() - 1];
        }
    } else {
        queue<int> q;
        for (int i = 2; i <= n; i ++ ) {
            if (in[i] == 0) {
                q.push(i);
            }
        }
        q.push(1);
        if (q.size() >= 2) {
            while (q.size()) {
                auto t = q.front();
                ans.push_back(t);
                q.pop();
                for (auto v : g[t]) {
                    in[v] --;
                    if (in[v] == 0) {
                        q.push(v);
                    }
                }
            }
            cout << "Yes" << '\n';
            for (int i = 0; i < (int)ans.size(); i ++ ) {
                cout << ans[i] << " \n"[i == (int)ans.size() - 1];
            }
        } else {
            cout << "No" << '\n';
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T -- ) {
        solve();
    }
    return 0;
}