#include <bits/stdc++.h> #define maxn 1008 using namespace std; int n,m,x,k; vector<int> gr[maxn],res[maxn]; int dinh[maxn]; bool Visit[maxn]; void enter() { cin>>n>>m; int u,v; for (int i=1;i<= m;i++ ) { cin>>u>>v; gr[u].push_back(v); gr[v].push_back(u); } for (int i=1;i<= n;i++ ) sort(gr[i].begin(),gr[i].end()); } void dfs(int u) { x++; Visit[u]=true; res[k].push_back(u); for (int v : gr[u] ) { if (!Visit[v]) { Visit[v]=true; dfs(v); } } } void xuat() { cout<<k<<'\n'; for (int i=1;i<= k;i++ ) { cout<<dinh[i]<<" "; sort(res[i].begin(),res[i].end()); for (int v : res[i]) cout<<v<<" "; cout<<'\n'; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); enter(); for (int i=1;i<= n;i++ ) { x=0; if (!Visit[i]) { k++; Visit[i]=true; dfs(i); dinh[k]=x; } } xuat(); return 0; }