#include<bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
vector<int> e[1<<17],g[1<<17];
int fa[1<<17],to[1<<17],from[1<<17];
int u[1<<17],v[1<<17],d[1<<17];
signed main()
{
	for(int T=read();T--;)
	{
		int n=read(),m=read();
		for(int i=1; i<=n; ++i) e[i].clear(),g[i].clear(),d[i]=0;
		for(int i=1; i<=m; ++i)
			u[i]=read(),v[i]=read(),
			++d[u[i]],++d[v[i]];
		for(int i=1; i<=n; ++i) from[i]=i;
		sort(from+1,from+n+1,[&](int x,int y){return d[x]<d[y];});
		for(int i=1; i<=n; ++i) to[from[i]]=i; 
		for(int i=1; i<=n; ++i) fa[i]=n+1;
		for(int i=1; i<=m; ++i)
		{
			int U=to[u[i]],V=to[v[i]];
			if(U>V) swap(U,V);
			// printf("edge %d %d\n",U,V);
			fa[U]=min(fa[U],V),
			e[U].push_back(V);
		}
		// for(int i=1; i<=n; ++i)
		for(int i=1; i<=n; ++i)
			sort(e[i].begin(),e[i].end());
		bool gg=0;
		for(int i=1; i<=n; ++i)
		{
			int w=i;
			for(int j:e[i])
			{
				w=fa[w];
				if(w==n+1){gg=1;break;}
				if(w!=j){gg=1;break;}
			}
			if(gg) break;
			if(fa[w]!=n+1){gg=1;break;}
		}
		if(gg){puts("No");continue;}
		puts("Yes");
		for(int i=1; i<=n; ++i) if(fa[i]<=n)
			g[fa[i]].push_back(i);
		for(int i=1; i<=n; ++i)
		{
			printf("%d ",from[i]);
			if(g[i].empty()) puts("0");
			else
			{
				printf("%d ",(int)g[i].size());
				int z=g[i].back();
				for(int j:g[i]) if(j!=z) printf("%d ",from[j]);
				printf("%d\n",from[z]);
			}
		}
	}
	return 0;
}