#include <stdio.h>
#include <vector>
#include <stack>
using namespace std;
int n,m,i,h[100001],d[100001],t[100001],x,y,nr,j;
bool o[100001],pa[100001];
vector<int> G[100001],r[100001];
stack<pair<int,int> > Q;
void afis(int a,int b)
{
    pair<int,int> x;
    ++nr;
    x=Q.top();
    while (x.first!=a||x.second!=b)
    {
        r[nr].push_back(x.second);
        Q.pop();
        x=Q.top();
    }
    Q.pop();
    r[nr].push_back(b);
    r[nr].push_back(a);
}
void DFS(int s)
{
    int i,z=G[s].size();
    o[s]=1;
    d[s]=h[s];
    for (i=0;i<z;i++)
        if (!o[G[s][i]])
    {
        t[G[s][i]]=s;
        h[G[s][i]]=h[s]+1;
        Q.push(make_pair(s,G[s][i]));
        DFS(G[s][i]);
        d[s]=min(d[s],d[G[s][i]]);
        if (d[G[s][i]]>=h[s]) afis(s,G[s][i]);
    }
    else if (G[s][i]!=t[s]) d[s]=min(d[s],h[G[s][i]]);
}
int main()
{
    freopen ("biconex.in","r",stdin);
    freopen ("biconex.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%i%i",&x,&y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for (i=1;i<=n;i++)
        if (!o[i]) DFS(i);
    printf("%i",nr);
    for (i=1;i<=nr;i++)
    {
        printf("\n");
        for (j=0;j<r[i].size();j++) printf("%i ",r[i][j]);
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}