#include <bits/stdc++.h>

using namespace std;

const int nmax = 1e5 + 10;

int n, m;
vector < int > g[nmax];

vector < pair < int, int > > v;
vector < vector < int > > ans;

int used[nmax], lvl[nmax], low[nmax];

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

void get_biconex(pair < int, int > edge) {
    vector < int > curr;
    while (true) {
        pair < int, int > curr_edge = v.back(); v.pop_back();
        curr.push_back(curr_edge.second);

        if (curr_edge == edge) break;
    }

    curr.push_back(edge.first);
    ans.push_back(curr);
}

void dfs(int node) {
    used[node] = 1; low[node] = lvl[node];
    for (auto &it: g[node]) {
        if (used[it]) {
            low[node] = min(low[node], lvl[it]);
            continue;
        }

        v.push_back({node, it});

        lvl[it] = lvl[node] + 1;
        dfs(it);

        if (low[it] >= lvl[node])
            get_biconex({node, it});
        low[node] = min(low[node], low[it]);
    }
}

void output() {
    printf("%d\n", (int)ans.size());
    for (int i = 0; i < (int)ans.size(); ++i, printf("\n"))
        for (auto &it: ans[i]) printf("%d ", it);
}

int main() {
    freopen("biconex.in","r",stdin);
    freopen("biconex.out","w",stdout);

    input();
    dfs(1);
    output();

    return 0;
}