#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
#define no { puts("No"); return; }
#define yes { puts("Yes"); return; }
using namespace std;
const int maxn = 100010;
int n, m, p[maxn];
vector < int > a[maxn];
void solve() {
    cin >> n >> m;
    rep(i, 1, n) {
        cin >> p[i];
        a[i].clear();
        rep(j, 0, p[i] - 1) {
            int x;
            cin >> x;
            a[i].emplace_back(x);
        }
        sort(a[i].begin(), a[i].end());
    }
    rep(i, 1, n - 1) {
        set < int > s;
        rep(j, 0, p[i] - 1) s.insert(a[i][j]);
        bool flag = 1;
        rep(j, 0, p[i + 1] - 1) if(s.count(a[i + 1][j])) {
            flag = 0;
            break;
        }
        if(flag) {
            cout << "Yes\n";
            rep(k, 1, i - 1) cout << k << " ";
            cout << i + 1 << " " << i << " ";
            rep(k, i + 2, n) cout << k << " ";
            cout << '\n';
            return;
        }
    }
    cout << "No\n";
}

int main() {
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while(T --) solve();
    return 0;
}