#include<bits/stdc++.h>
using namespace std;
#define int long long
int read() {
  int res = 0, flg = 1;
  char c = getchar();
  while(!isdigit(c)) {
    if(c == '-') flg = 0;
    c = getchar();
  }
  while(isdigit(c)) {
    res = (res << 3) + (res << 1) + (c ^ 48);
    c = getchar();
  }
  return flg ? res : -res;
}
const int N = 1e6 + 10;
vector<int> v[N];
int n, m, has[N];
int inter(vector<int>& a, vector<int>& b) {
  int i = 0, j = 0;
  int res = 0;
  while(i < a.size() && j < b.size()) {
    if(a[i] < b[j]) i++;
    else if(a[i] > b[j]) j++;
    else {
      i++, j++;
      res++;
    }
  }
  return res;
}
void solve() {
  n = read(), m = read();
  for(int i = 1; i <= m; i++) has[i] = 0;
  int num;
  for(int i = 1; i <= n; i++) {
    v[i].clear();
    num = read();
    for(int j = 1; j <= num; j++) {
      v[i].push_back(read());
    }
    sort(v[i].begin(), v[i].end());
  }
  for(int i = 0; i < v[n].size(); ++i) {
    has[v[n][i]] = 1;
  }
  for(int i = n - 1; i; --i) {
    num = inter(v[i], v[i + 1]);
    if(!num) {
      cout << "Yes\n";
      for(int j = 1; j < i; j++) cout << j << ' ';
      cout << i + 1 << ' ';
      cout << i << ' ';
      for(int j = i + 2; j <= n; j++) cout << j << ' ';
      cout << '\n';
      return;
    }
    int r = v[i].size() - 1;
    for(int j = 0; j <= r; j++) {
      if(has[v[i][j]]) {
        swap(v[i][j], v[i][r]);
        r--;
        j--;
      }
    }
    for(int j = 0; j < v[i].size(); j++) {
      cout << v[i][j] << ' ';
    }
    
    v[i].erase(v[i].begin() + r + 1, v[i].end());
    
    for(int j = 0; j < v[i].size(); j++) {
      has[v[i][j]] = 1;
    }
    for(int j = 0; j < v[i].size(); j++) {
      has[v[i][j]] = 1;
    }
  }
  cout << "No" << '\n';
}
signed main() {
  int t = read();
  while(t--) {
    solve();
  }
  return 0;
}