#include <fstream>
#include <vector>
#include <stack>
#include <set>
using namespace std;
ifstream cin("biconex.in");
ofstream cout("biconex.out");
int n,m;
vector<int> G[100005];
vector<set<int>> CBC;
set<int> c;
stack<pair<int,int>> st;
int idx[100005],low[100005],v[100005],t[100005],cnt;
void extractCBC(int a,int b)
{
    c.clear();
    while(!st.empty())
    {
        auto [x,y]=st.top();
        st.pop();
        c.insert(x);
        c.insert(y);
        if(a==x && b==y)
            break;
    }
    CBC.push_back(c);
}
void dfs(int x)
{
    idx[x]=low[x]=++cnt;
    v[x]=1;
    for(auto y:G[x])
    {
        if(y==t[x]) continue;
        if(!v[y])
        {
            t[y]=x;
            st.emplace(x,y);
            dfs(y);
            low[x]=min(low[x],low[y]);
            if(low[y]>=idx[x]) /// x - articulatie
                extractCBC(x,y);
        }
        else
            low[x]=min(low[x],idx[y]);
    }
}
void biconex()
{
    for(int i=1;i<=n;i++)
        if(!v[i])
            dfs(i);
    cout<<CBC.size()<<"\n";
    for(auto c:CBC)
    {
        for(auto x:c)
            cout<<x<<" ";
        cout<<"\n";
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    biconex();
    return 0;
}