#include <fstream>
#include <vector>

#define nMax 100002
#define pb push_back
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
int n, m, nrcbc;
int Low[nMax], Lev[nMax];
vector<int> G[nMax], CBC[nMax], Stck;
void read()
{
    int a, b;
    fin>>n>>m;

    for(int i=1;i<=m;i++)
    {
        fin>>a>>b;
        G[a].pb(b);
        G[b].pb(a);
    }
}
void tarjan(int node, int tata)
{
    Lev[node]=Lev[tata]+1;
    Low[node]=Lev[node];
    Stck.pb(node);

    for(vector<int>::iterator it=G[node].begin();it!=G[node].end();it++)
    {
        int fiu=*it;
        if(fiu==tata)
            continue;

        if(Lev[fiu])
            Low[node]=min(Low[node], Lev[fiu]);
        else
        {
            tarjan(fiu, node);
            Low[node]=min(Low[node], Low[fiu]);
            if(Low[fiu]>=Lev[node])
            {
                int son;
                nrcbc++;
                CBC[nrcbc].pb(node);

                do
                {
                    son=Stck.back();
                    Stck.pop_back();
                    CBC[nrcbc].pb(son);
                }
                while(son!=fiu);
            }
        }
    }
}
void solve()
{
    for(int i=1;i<=n;i++)
        if(Lev[i]==0)
            tarjan(i, 0);
}
void write()
{
    fout<<nrcbc<<'\n';

    for(int i=1;i<=nrcbc;i++)
    {
        for(vector<int>::iterator it=CBC[i].begin();it!=CBC[i].end();it++)
            fout<<*it<<" ";
        fout<<'\n';
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}