#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define pb push_back
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005
#define x1 xdddddddddddddddddd
#define y1 ydddddddddddddddddd

int n,m,x,y,v[200005],k,w[200005];

vector <int> g[200005];

vector <vector<int>> ans;

stack <pi> s;

void DFS(int nod, int p, int h){
    v[nod]=h; w[nod]=h;
    for(int i : g[nod]){
        if(i==p) continue;
        if(!v[i]){
            s.push({nod,i}),DFS(i,nod,h+1);
            w[nod]=min(w[nod],w[i]);
            if(w[i]>=v[nod]){
                pi t; ans.pb({});
                do{
                    t=s.top(); s.pop();
                    ans[ans.sz-1].pb(t.y);
                }while(t!=make_pair(nod,i));
                ans[ans.sz-1].pb(nod);
            }
        }
       else w[nod]=min(w[nod],w[i]);
    }
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("biconex.in");
    ofstream cout("biconex.out");
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    for(int i=1;i<=n;i++){
        if(!v[i]) DFS(i,0,1);
    }
    cout << ans.sz << '\n';
    for(vector <int> i : ans){
        for(int j : i) cout << j << ' ';
        cout << '\n';
    }
}