#include <bits/stdc++.h>
#define ll long long int
#define loop(i,o,n,step) for(auto i{o}; i < n; i += step)
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

bool check(vector<int> &a, vector<int> &b){
    loop(i,0,a.size(),1){
        if(binary_search(b.begin(), b.end(), a[i]))
            return false;
    }
    return true;
}

void solve(){
    int n, m;
    cin >> n >> m;
    vector<int> vec[n];
    int p[n]{};
    loop(i,0,n,1){
        cin >> p[i];
        loop(j, 0, p[i], 1){
            int tmp;
            cin >> tmp;
            vec[i].push_back(tmp);
        }
        sort(vec[i].begin(), vec[i].end());
    }
    loop(i,1,n,1){
        if(check(vec[i-1], vec[i])){
            cout << "Yes\n";
            loop(j, 0, i - 1, 1) cout << j + 1 << " ";
            cout << i+1 << " " << i << " ";
            loop(j, i + 1, n, 1) cout << j + 1 << (j != n - 1 ? " " : "");
            cout << "\n";
            return;
        }
    }
    cout << "No\n";
}

int main(){
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}