#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

ifstream is("biconex.in");
ofstream os("biconex.out");

using VI = vector<int>;
using VB = vector<bool>;
using VVI = vector<VI>;

int n, m;
VI nv, nm, t, c;
VVI g, cb;
stack<pair<int, int>> s;

void Read();
void Solve(int nod, int niv);
void Write();

int main()
{
    Read();
    nv = nm = t = VI(n + 1);
    for ( int i = 1; i <= n; ++i )
        if ( !nv[i] )
            Solve(i, 1);
    Write();
    is.close();
    os.close();
    return 0;
}

void Solve(int nod, int niv)
{
    nv[nod] = nm[nod] = niv;
    for ( const auto& nodv : g[nod] )
        if ( !nv[nodv] )
        {
            s.push(make_pair(nod, nodv));
            t[nodv] = nod;
            Solve(nodv, niv + 1);
            nm[nod] = min(nm[nod], nm[nodv]);
            if ( nm[nodv] >= nv[nod] )
            {
                int x, y;
                c.clear();
                do {
                    c.push_back(x = s.top().first);
                    c.push_back(y = s.top().second);
                    s.pop();
                } while ( x != nod && y != nod );
                sort(c.begin(), c.end());
                c.erase(unique(c.begin(), c.end()), c.end());
                cb.push_back(c);
            }
        }
        else
            if ( t[nod] != nodv )
                nm[nod] = min(nm[nod], nv[nodv]);
}

void Read()
{
    is >> n >> m;
    g = VVI(n + 1);
    int n1, n2;
    while ( m-- )
    {
        is >> n1 >> n2;
        g[n1].push_back(n2);
        g[n2].push_back(n1);
    }
}

void Write()
{
    os << cb.size() << "\n";
    for ( const auto& i : cb )
    {
        for ( const auto& j : i )
            os << j << " ";
        os << "\n";
    }
}