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

using namespace std;

const int nmx = 100002;

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

void citire()
{
    scanf("%d %d", &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 actualizare(int nod, int tata)
{
    aux.clear();
    while(st.top() != tata)
    {
        aux.push_back(st.top());
        st.pop();
    }
    st.pop();
    aux.push_back(tata);
    aux.push_back(nod);
    ans.push_back(aux);
}

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

void calcul()
{
    for(int i = 1; i <= n; ++i)
        if(not grad[i])
        {
            st.push(i);
            dfs(0,i);
            st.pop();
        }
}

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

int main()
{
    freopen("biconex.in", "r", stdin);
    freopen("biconex.out", "w", stdout);
    citire();
    calcul();
    afish();
    return 0;
}