#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=1e5+3;
int n,m,fa[N],p[N],cnt[N],vis[N];
vector<int>G[N];
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
vector<int>vec[N];
inline void solve(){
	n=read(),m=read();
	rep(i,1,n)G[i].clear(),vec[i].clear(),fa[i]=0,p[i]=i,cnt[i]=vis[i]=0;
	rep(i,1,m){
		int u=read(),v=read();
		G[u].pb(v),G[v].pb(u);
	}
	sort(p+1,p+n+1,[&](int i,int j){return G[i].size()<G[j].size();});
	rep(I,1,n){
		int i=p[I];fa[i]=i,cnt[i]=1;
		for(int j:G[i])if(fa[j]){
			int v=find(j);vec[i].pb(v);
			++vis[v];
		}
		bool fl=1;
		sort(vec[i].begin(),vec[i].end());
		vec[i].erase(unique(vec[i].begin(),vec[i].end()),vec[i].end());
		for(int v:vec[i]){
			if(vis[v]!=cnt[v]){fl=0;break;}
			vis[v]=0;
		}
		if(!fl){
			puts("No");
			return ;
		}
		for(int v:vec[i])fa[v]=i,cnt[i]+=cnt[v];
	}
	puts("Yes");
	rep(I,1,n){
		int i=p[I];
		printf("%d %d ",i,vec[i].size());
		for(int x:vec[i])printf("%d ",x);
		puts("");
	}
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	int T=read();while(T--)solve();
    return 0;
}