#include<bits/stdc++.h>
#ifndef xxx
#define dbg(...) ;
#endif
using namespace std;
template<class T> ostream &operator<<(ostream &o, const vector <T> &v) { bool f=false; for(T i:v) { f?o<<' ':o; o<<(i); f=true; } return o; }
template<class T> void sort(T &v) { std::sort(v.begin(), v.end()); }
template<class T, class C> void sort(T &v, C c) { std::sort(v.begin(), v.end(), c); }
template<class T> void reverse(T &v) { std::reverse(v.begin(), v.end()); }
template<class T> bool is_sorted(T &v) { return std::is_sorted(v.begin(), v.end()); }
template<class T> inline void _min(T &x, const T &y) { x>y?x=y:x; }
template<class T> inline void _max(T &x, const T &y) { x<y?x=y:x; }
istream &operator>>(istream &i, __int128_t &x) { x=0; short f=1; char c=0; while(!isdigit(c)) { if(c=='-')f=-1; c=i.get(); } while(isdigit(c))x=x*10+c-'0', c=i.get(); x*=f; return i; }
ostream &operator<<(ostream &o, __int128_t x) { if(x==0) { o<<0; return o; } bool f=false; string s; if(x<0)f=true, x=-x; while(x)s+=x%10+'0', x/=10; reverse(s); if(f)o<<'-'; o<<s; return o; }
mt19937 mt(time(0));
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
constexpr int maxn=1e5+5;
constexpr int mod=1e9+7;
constexpr int inf=0x3f3f3f3f;
constexpr ll INF=0x3f3f3f3f3f3f3f3fll;
constexpr double pi=acos(-1.0);
constexpr double eps=1e-9;
vector<int>vec[maxn];
int main()//MARK: main
{
#ifndef xxx
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
	cout<<fixed<<setprecision(10);
	int t;
	cin>>t;
	while(t--)
	{
		int n, m;
		cin>>n>>m;
		for(int i=1; i<=n; i++)
			vec[i].clear();
		for(int i=1; i<=n; i++)
		{
			int k;
			cin>>k;
			vec[i].resize(k);
			for(int &x:vec[i])
				cin>>x;
			sort(vec[i]);
		}
		auto getans=[&]()->vector<int>
		{
			vector<int>ans(n);
			iota(ans.begin(), ans.end(), 1);
			for(int i=2; i<=n; i++)
			{
				vector<int>inter(vec[i].size());
				inter.erase(set_intersection(vec[i].begin(), vec[i].end(), vec[i-1].begin(), vec[i-1].end(), inter.begin()), inter.end());
				if(inter.empty())
				{
					swap(ans[i-2], ans[i-1]);
					return ans;
				}
			}
			set<int>se;
			for(int i=n; i>=3; i--)
			{
				se.insert(vec[i].begin(), vec[i].end());
				vector<int>inter(vec[i-1].size());
				inter.erase(set_intersection(vec[i-1].begin(), vec[i-1].end(), vec[i-2].begin(), vec[i-2].end(), inter.begin()), inter.end());
				if(includes(se.begin(), se.end(), inter.begin(), inter.end()))
				{
					//dbg(i,inter,se);
					swap(ans[i-2], ans[i-3]);
					return ans;
				}
			}
			return vector<int>();
		};
		auto ans=getans();
		if(ans.empty())
		{
			cout<<"No"<<'\n';
		}
		else
		{
			cout<<"Yes"<<'\n';
			cout<<ans<<'\n';
		}
	}
	return 0;
}