/// Preset de infoarena
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <iomanip>

using namespace std;

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

const int maxN = 100005;
int n, m;
int depth[maxN], lowlink[maxN];
bool viz[maxN];
vector <int> G[maxN], stiva;
vector <vector<int>> bicomp;

void dfs(int nod, int tata)
{
    viz[nod] = 1;
    depth[nod] = depth[tata] + 1;
    lowlink[nod] = depth[nod];
    stiva.push_back(nod);
    for(int vecin : G[nod])
    {
        if(vecin == tata)
            continue;
        if(viz[vecin])
            lowlink[nod] = min(lowlink[nod], depth[vecin]);
        else
        {
            dfs(vecin, nod);
            lowlink[nod] = min(lowlink[nod], lowlink[vecin]);
            if(depth[nod] <= lowlink[vecin])
            {
                vector <int> comp;
                while(!stiva.empty() && stiva.back() != vecin)
                {
                    comp.push_back(stiva.back());
                    stiva.pop_back();
                }
                comp.push_back(vecin);
                stiva.pop_back();
                comp.push_back(nod);
                bicomp.push_back(comp);
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs(1, 0);
    fout << bicomp.size() << '\n';
    for(auto c : bicomp)
    {
        for(int elem : c)
            fout << elem << ' ';
        fout << '\n';
    }
    return 0;
}