#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#define pb push_back
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");

typedef pair< int, int > edge;
int N, M, found[100002], order, low[100002], x, y, dad[100002];
vector < int > G[100002], Part;
vector < vector <int> > BCC;
vector < edge > CritEdge;
stack < edge > st;

template <class T>
inline void EliminaDuplicate(vector < T > &V)
{
    sort(V.begin(), V.end());
    V.erase(unique(V.begin(), V.end()), V.end());
}

void getbcc(edge M)
{
    vector < int > newbcc;
    edge E;
    do
    {
        E=st.top(); st.pop();
        newbcc.pb(E.first); newbcc.pb(E.second);
    }while(E!=M);
    EliminaDuplicate(newbcc);
    BCC.pb(newbcc);
}

void dfs(int nod)
{
    found[nod]=low[nod]=++order;
    vector <int>::iterator it=G[nod].begin();
    for (; it!=G[nod].end(); ++it)
        if (!dad[*it])
        {
            dad[*it]=nod; st.push(edge(nod, *it));
            dfs(*it);
            low[nod]=min(low[nod], low[*it]);
            if (low[*it]>=found[nod])
                Part.pb(nod), getbcc(edge(nod, *it));

            if (low[*it]>found[nod])
                CritEdge.pb(edge(nod, *it));
        }
        else if (*it!=dad[nod])
                low[nod]=min(low[nod], found[*it]);
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
        f>>x>>y, G[x].pb(y), G[y].pb(x);
    for (int i=1; i<=N; ++i)
        if (!dad[i]) dad[i]=i, dfs(i);

    g<<BCC.size()<<'\n';
    for (int i=0; i<BCC.size(); ++i && g<<'\n')
        for (int j=0; j<BCC[i].size(); ++j)
            g<<BCC[i][j]<<' ';
    return 0;
}