#include <bits/stdc++.h>
using namespace std;
int n, m, a[100010][2], b[100010], c[100010], deg[100010], hd[100010], e[200010][2], fa[100010], siz[100010];
vector<int> ans[100010], T[100010];
set<int> S[100010];
bool cmp(int x, int y){ return deg[x] > deg[y]; }
void solve(){
	int i, j, u, v, x = 0;
	scanf("%d%d", &n, &m);
	for(i = 1; i <= n; i++) deg[i] = 0, hd[i] = 0, b[i] = i, siz[i] = 1, ans[i].clear(), S[i].clear(), T[i].clear();
	for(i = 1; i <= n; i++) T[i].push_back(i);
	for(i = 1, j = 1; i <= m; i++, j++){
		scanf("%d%d", &u, &v); deg[u]++; deg[v]++;
		e[j][0] = hd[u]; e[j][1] = v; hd[u] = j;
		j++;
		e[j][0] = hd[v]; e[j][1] = u; hd[v] = j;
		S[u].insert(v); S[v].insert(u);
	}
	sort(b + 1, b + n + 1, cmp);
	for(i = 1; i <= n; i++) c[b[i]] = i;
	for(u = 1; u <= n; u++){
		fa[u] = 0;
		for(i = hd[u]; i > 0; i = e[i][0]){
			v = e[i][1];
			if(c[v] < c[u] && (fa[u] == 0 || c[v] > c[fa[u]])) fa[u] = v;
		}
		if(fa[u] > 0) ans[fa[u]].push_back(u);
	}
	for(i = n; i >= 1; i--){
		u = b[i];
		x += siz[u] - 1;
		if(fa[u] > 0){
			siz[fa[u]] += siz[u];
			for(j = 0; j < T[u].size(); j++){
				if(!S[fa[u]].count(T[u][j])){ printf("No\n"); return; }
				T[fa[u]].push_back(T[u][j]);
			}
		}
	}
	if(x < m){ printf("No\n"); return; }
	printf("Yes\n");
	for(i = n; i >= 1; i--){
		printf("%d %d ", b[i], ans[b[i]].size());
		for(j = 0; j < ans[b[i]].size(); j++) printf("%d ", ans[b[i]][j]);
		printf("\n");
	}
}
int main()
{
	int t;
	scanf("%d", &t);
	while(t--) solve();
	return 0;
}