#include <fstream>
#include <vector>
#include <stack>
#define nmax 100002
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");

vector <int> sol[nmax];
vector <int> graf[nmax];
stack <int> st;
int t[nmax],l[nmax],v[nmax],ni[nmax],n,m,k,nr=0;

void df(int nod)
{
    v[nod]=1;
    ni[nod]=ni[t[nod]]+1;
    l[nod]=ni[nod];
    st.push(nod);
    for(int i=0;i<graf[nod].size();i++)
    {
        int p=graf[nod][i];
        if(v[p])
        {
            if(p!=t[nod])
                low[nod]=min(low[nod],nivel[p]);
            continue;
        }
        t[p]=nod;
        df(p);
        low[nod]=min(low[nod],low[p]);
        if(nivel[nod]<=l[p]);
        {
            nr++;
            do{
                int k=st.top();
                sol[nr].push_back(k);
                st.pop();
            }while(k!=p);
            sol[nr].push_back(nod);
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
    {
        if(v[i]==0)
        {
            t[i]=0;
            df(i);
        }
    }
    fout<<nr<<"\n";
    for(int i=1;i<=nr;i++)
    {
        for(int j=0;j<sol[i].size();j++)
            fout<<sol[i][j]<<" ";
        fout<<"\n";
    }
    return 0;
}