#include <bits/stdc++.h>

using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
typedef pair<int,int> pii;
int n,m,nivmin[200005],niv[200005],nr;
bool use[200005];
vector<int> muchii[200005];
vector<vector<int>> sol;
deque<pii> st;
void solve(int x,int y)
{
    vector<int> v;
    while(true)
    {
        int a=st.back().first;
        int b=st.back().second;
        st.pop_back();
        v.push_back(a);
        v.push_back(b);
        if(a==x&&b==y)
            break;
    }
    //v.erase(unique(v.begin(),v.end()),v.end());
    sol.push_back(v);
}
void dfs(int nod,int level,int parent)
{
    nr++;
    use[nod]=1;
    niv[nod]=nr;
    nivmin[nod]=nr;
    for(auto i:muchii[nod])
    {
        if(i==parent)
            continue;
        if(!use[i])
        {
            st.push_back({nod,i});
            dfs(i,level+1,nod);
            nivmin[nod]=min(nivmin[nod],nivmin[i]);
            if(nivmin[i]>=niv[nod])
                solve(nod,i);
        }
        nivmin[nod]=min(nivmin[nod],niv[i]);
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fout.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }
    dfs(1,1,0);
    fout<<sol.size()<<'\n';
    for(auto i:sol)
    {
        sort(i.begin(),i.end());
        i.erase(unique(i.begin(),i.end()),i.end());
        for(auto j:i)
            fout<<j<<" ";
        fout<<'\n';
    }
    return 0;
}