#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("biconex.in");
ofstream fout("biconex.out");

#define lim 100010
int n,m,dr;
vector <vector <int>> rez;
vector <int> G[lim];
int viz[lim], lvl[lim], minlvl[lim];
vector <pair <int, int>> st;

void dfs (int nod, int dad)
{
    viz[nod]=1;
    lvl[nod]=lvl[dad]+1;
    minlvl[nod]=lvl[nod];
    for (auto it:G[nod])    if (it!=dad)
        if (!viz[it])
        {
            st.push_back ({nod, it});
            dfs (it, nod);
            minlvl[nod] = min (minlvl[nod], minlvl[it]);
            if (minlvl[it]>=lvl[nod])
            {
                vector <int> aux;
                while (make_pair(nod, it) != st.back())
                {
                    aux.push_back(st.back().second);
                    st.pop_back();
                }
                st.pop_back();
                aux.push_back(nod);
                aux.push_back(it);
                rez.push_back(aux);
            }
        }
        else
            minlvl[nod] = min (lvl[it], minlvl[nod]);
}

int main()
{
    int x,y;
    fin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    for (int i=1; i<=n; i++)
        if (!viz[i])    dfs (i, 0);

    fout<<rez.size()<<'\n';
    for (auto it:rez)
    {
        for (auto itt:it)
            fout<<itt<<' ';
        fout<<'\n';
    }

    fout.close();
    return 0;
}