#include <bits/stdc++.h>

using namespace std;

ifstream fin ("biconex.in");
ofstream fout ("biconex.out");

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

vector < int > a[N];
vector < vector < int > > sol;
stack < pair < int, int > > st;

int disc[N], low[N], temp;

void found(int x, int y)
{
    vector < int > add;
    pair < int, int > top;
    do {
        top = st.top();
        add.push_back(top.first), add.push_back(top.second);
        st.pop();
    }
    while(top.first != x && top.second != y);
    sol.push_back(add);
}
void dfs(int k)
{
    disc[k] = low[k] = ++temp;
    for(auto v : a[k]) {
        if(disc[v] == false) {
            st.push({k, v});
            dfs(v);
            low[k] = min(low[k], low[v]);
            if(low[v] >= disc[k]) found(k, v);
        }
        else low[k] = min(low[k], disc[v]);
    }
}

int main()
{
    usain_bolt();

    int n, m;

    fin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y;

        fin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    for(int i = 1; i <= n; ++i) {
        if(disc[i] == false) dfs(i);
    }
    fout << sol.size() << "\n";
    for(size_t i = 0; i < sol.size(); ++i) {
        sort(sol[i].begin(), sol[i].end());
        sol[i].erase(unique(sol[i].begin(), sol[i].end()), sol[i].end());
        for(size_t j = 0; j < sol[i].size(); ++j) fout << sol[i][j] << " ";
        fout << "\n";
    }
    return 0;
}