#include <fstream>
#include <vector>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>

#define INF 0x3f3f3f3f
#define NMax 100005
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");

int viz[NMax],low[NMax];
vector<int> G[NMax],c[NMax];
stack<int> s;
int x,y,n,m,COMP;

void dfs(int nod, int tata){
    viz[nod] = viz[tata] + 1;
    low[nod] = viz[nod];

    ///fac componenta
    s.push(nod);

    for(int i = 0; i < G[nod].size(); ++i){
    //    if(nod != tata){
            if(!viz[G[nod][i]]){
                dfs(G[nod][i],nod);

                low[nod] = min(low[nod],low[G[nod][i]]);

                if(low[G[nod][i]] >= viz[nod]){
                    COMP++;
                    do{
                        x = s.top();
                        s.pop();
                        c[COMP].push_back(x);
                    }while(x != G[nod][i]);
                    c[COMP].push_back(nod);
                }
            }else
                low[nod] = min(low[nod],viz[G[nod][i]]);
      //  }
    }
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i){
        f >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for(int i = 1; i <= n; ++i){
        if(!viz[i])
            dfs(i,0);
    }
    g << COMP << '\n';
    for(int i = 1; i <= COMP; ++i){
        for(int j = 0; j < c[i].size(); ++j){
            g << c[i][j] << ' ';
        }
        g << '\n';
    }
    return 0;
}