#include <cstdio>
#include <stack>
#include <vector>

using namespace std;

const int nmx = 100002;

int n,m;
int niv[nmx], grad[nmx];
vector <int> g[nmx], aux;
vector <vector<int> > af;
stack <int> st;

void citire()
{
    scanf("%d %d\n", &n, &m);
    for(int i = 1; i <= m; ++i)
    {
        int nod1,nod2;
        scanf("%d %d", &nod1, &nod2);
        g[nod1].push_back(nod2);
        g[nod2].push_back(nod1);
    }
}

void o_sa_fie_afisare(int nod, int tata)
{
    aux.clear();
    while(st.top() != nod)
    {
        aux.push_back(st.top());
        st.pop();
    }
    st.pop();
    aux.push_back(nod);
    aux.push_back(tata);
    af.push_back(aux);
}

void parcurgere(int tata, int nod)
{
    niv[nod] = grad[nod] = niv[tata] + 1;
    for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        if(not niv[*it])
        {
            st.push(*it);
            parcurgere(nod,*it);
            grad[nod] = min(grad[nod],grad[*it]);
            if(grad[*it] >= niv[nod])
                o_sa_fie_afisare(*it,nod);
        }
        else
            grad[nod] = min(grad[nod],niv[*it]);
}

void afish()
{
    printf("%d\n", af.size());
    for(size_t i = 0; i < af.size(); ++i)
    {
        for(size_t j = 0; j < af[i].size(); ++j)
            printf("%d ", af[i][j]);
        printf("\n");
    }
}

int main()
{
    freopen("biconex.in", "r", stdin);
    freopen("biconex.out", "w", stdout);
    citire();
    for(int i = 1; i <= n; ++i)
        if(not niv[i])
        {
            st.push(i);
            parcurgere(0,i);
            st.pop();
        }
    afish();
    return 0;
}