// https://www.infoarena.ro/problema/biconex
#include <bits/stdc++.h>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
const int NMAX=1e5+8;
int n,m;
vector<int> g[NMAX];
int low[NMAX],tin[NMAX],timer;
bool viz[NMAX];
vector<vector<int> > ans;
vector<pair<int,int> > stk;
vector<int> pop_until(int x,int y) {
set<int> s;
while(!stk.empty() && (stk.back().first!=x || stk.back().second!=y)) {
s.insert(stk.back().first);
s.insert(stk.back().second);
stk.pop_back();
}
s.insert(x);
s.insert(y);
stk.pop_back();
return vector<int>(s.begin(),s.end());
}
void dfs(int nod,int daddy=0) {
viz[nod]=1;
tin[nod]=++timer;
low[nod]=tin[nod];
for(const auto &vec:g[nod]) {
if(vec==daddy) {
continue;
}
if(viz[vec]) {
low[nod]=min(low[nod],tin[vec]);
}
else {
stk.push_back({nod,vec});
dfs(vec,nod);
low[nod]=min(low[nod],low[vec]);
if(low[vec]>=tin[nod]) {
ans.push_back(pop_until(nod,vec));
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n >> m;
for(int i=1; i<=m; i++) {
int x,y;
fin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for(int i=1; i<=n; i++) {
if(!viz[i]) {
timer=0;
dfs(i);
}
}
fout << (int)ans.size() << "\n";
for(const auto &v:ans) {
for(const auto &it:v) {
fout << it << " ";
}
fout << "\n";
}
return 0;
}