#include <bits/stdc++.h>

using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
unordered_set<int> c;
vector<int> c1,v[100010];
stack<pair<int,int> > St;
vector<vector<int> > C;
int n,m,i,x,y,niv[100010],up[100010];
void df(int nod,int tata);
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(i=1;i<=n;i++)
        if(!niv[i])
            df(i,0);
    g<<C.size()<<'\n';
    for(auto it:C)
    {
        for(auto that:it)
            g<<that<<' ';
        g<<'\n';
    }
    return 0;
}
void df(int nod,int tata)
{
    niv[nod]=up[nod]=niv[tata]+1;
    for(auto it:v[nod])
        if(it!=tata)
        {
            if(!niv[it])
            {
                St.push({nod,it});
                df(it,nod);
                up[nod]=min(up[nod],up[it]);
                if(up[it]>=niv[nod])
                {
                    c.clear();
                    c1.resize(0);
                    while((St.top().first!=nod)||(St.top().second!=it))
                    {
                        c.insert(St.top().second);
                        St.pop();
                    }c.insert(St.top().second);
                    c.insert(St.top().first);
                    St.pop();
                    for(auto that:c)
                        c1.push_back(that);
                    C.push_back(c1);
                }
            }
            else
                up[nod]=min(up[nod],niv[it]);
        }
}