#include <cstdio>
#include <vector>
#include <stack>
#define min(a,b) (a < b ? a : b)

using namespace std;

const int nmx = 100002;

int n,m,lvl[nmx],minim[nmx];
stack <int> st;
vector <int> g[nmx],aux;
vector <vector<int> > fin;

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

void adaug(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);
    fin.push_back(aux);
}

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

int main(){
    freopen("biconex.in", "r", stdin);
    freopen("biconex.out", "w", stdout);
    citire();
    for(vector<int>::iterator it = g[1].begin(); it != g[1].end(); ++it){
        st.push(*it);
        dfs(*it,1);
        st.pop();
    }
    printf("%d\n", fin.size());
    for(size_t i = 0; i < fin.size(); ++i){
        for(size_t j = 0; j < fin[i].size(); ++j)
            printf("%d ", fin[i][j]);
        printf("\n");
    }
    return 0;
}