#include <bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(m + 1);
    for (int i = 1; i <= n; i++) {
        int sz;
        cin >> sz;
        for (int j = 1; j <= sz; j++) {
            int x;
            cin >> x;
            a[x].push_back(i);
        }
    }
    priority_queue<pair<int, int>> q;
    for (int i = 1; i <= m; i++) {
        q.push({(int)a[i].size(), i});
    }
    vector<int> ans;
    vector<int> vis(n + 1);

    while (!q.empty()) {
        auto [siz, idx] = q.top();
        q.pop();

        if (siz == 0) break;
        if (!vis[a[idx].back()]) {
            ans.push_back(a[idx].back());
            vis[a[idx].back()] = 1;
        }
        a[idx].pop_back();
        q.push({siz - 1, idx});
    }

    reverse(ans.begin(), ans.end());
    vector<int> b(n);
    iota(b.begin(), b.end(), 1);
    if (ans == b) {
        cout << "No\n";
    } else {
        cout << "Yes\n";
        for (auto x : ans) {
            cout << x << " ";
        }
        cout << "\n";
    }
}

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

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}