#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 10002
using namespace std;
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
int n,m,start,nrc;

int uz[NMAX];
void citire ();
void dfs (int x);
void afisare();
vector <int> G[NMAX];
int main()
{
    int i;
    citire ();
    for(i=1; i<=n; i++)
        if(!uz[i]) ///am identificat o noua comp conex
        {
            nrc++;
            dfs(i);
        }
     fout<<nrc;

}
void citire ()
{
    int x,y;
    fin>>n>>m;
    while (fin>>x>>y)
    {
      ///adaug pe x in lista de adiacenta a lui y
      G[y].push_back(x);
      G[x].push_back(y);
    }

}
void dfs (int x)
{
    int i;
    ///parcurg graful incepand din vf x

    uz[x]=nrc;///il marchez pe x ca vizitat
    ///parcurg toti vec lui x in ordine crescatoare
    for(i=0; i<G[x].size(); i++)
        if(!uz[G[x][i]])
            dfs(G[x][i]);

}
void afisare()
{
    int i,j;
    fout<<nrc<<'\n';
    for(i=1; i<=nrc; i++)
    {
        ///afisez  vf care sunt in comp conexa cu nr i
        for(j=1; j<=n; j++)
            if(uz[j]==i)
                fout<<j<<' ';
        fout<<'\n';
    }
}