#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;

int main(){
    FAST
    int t;
    cin >> t;
    while(t--){
        int n, m;
        cin >> n >> m;
        vector<int> last(m, -1), vec[n], p(n, 0);
        loop(i,0,n,1){
            cin >> p[i];
            loop(j,0,p[i],1){
                int tmp;
                cin >> tmp;
                vec[i].push_back(tmp);
            } 
        }
        vector<int> ans(n);
        bool ansf{0};
        loop(i, 0, n, 1) ans[i] = i + 1;
        for (auto i{n - 1}; i >= 0; i--){
            bool flag{1};
            if(i == n-1)
                flag = 0;
            loop(j,0,p[i],1){
                if(last[vec[i][j]] == -1){
                    last[vec[i][j]] = i;
                }
                if(last[vec[i][j]] == i + 1)
                    flag = 0;
            }
            if(flag == 1){
                swap(ans[i], ans[i + 1]);
                ansf = 1;
                break;
            }
        }
        if(ansf){
            cout << "Yes\n";
            loop(i, 0, n, 1) cout << ans[i] << (i == n - 1 ? "\n" : " ");
        }
        else
            cout << "No\n";
    }
}