#include <bits/stdc++.h>

using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m, s;
queue <int> k;
int vizi[1000005] ;
int d[1000005];
int *A[1000005];
void BFS(int x)
{
    vizi[x]=1;
    for(int i=1;i<=A[x][0];i++)
    {
        if(vizi[A[x][i]]==0)
        {
            BFS(A[x][i]);
        }
    }
}

int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
    {
        A[i]= (int *)realloc(A[i], sizeof(int));
        A[i][0]=0;
    }
    for(int i=1;i<=m;i++)
    {
        d[i]=-1;
        int a, b;
        in>>a>>b;
        A[a][0]++;
        A[b][0]++;
        A[a]=(int *)realloc(A[a], (A[a][0]+1)*sizeof(int));
        A[a][A[a][0]]=b;
        A[b]=(int *)realloc(A[b], (A[b][0]+1)*sizeof(int));
        A[b][A[b][0]]=a;

    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=A[i][0];j++)
        {
            cout<<A[i][j]<<" ";
        }
        cout<<endl;
    }
    int nr=0;
    for(int i=1;i<=n;i++)
    {
        if(!vizi[i])
        {
            BFS(i);
            nr++;
        }
    }
    out<<nr;
    return 0;
}