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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> ops;
    for (int i = 0; i < n; ++i) {
      int l;
      cin >> l;
      vector<int> cur(l);
      for (auto &x : cur)
        cin >> x;
      sort(cur.begin(), cur.end());
      ops.push_back(cur);
    }
    bool ok = false;
    vector<int> ans(n);
    iota(all(ans), 1);
    for (int i = 1; i < n; ++i) {
      bool no = true;
      for (int x : ops[i]) {
        no &= not ranges::binary_search(ops[i - 1], x);
      }
      if (no) {
        ok = true;
        swap(ans[i], ans[i - 1]);
        break;
      }
    }
    if (not ok) {
      cout << "No\n";
      continue;
    }
    cout << "Yes\n";
    for (int i = 0; i < n; ++i) {
      cout << ans[i] << " \n"[i + 1 == n];
    }
  }
  return 0;
}