#include <bits/stdc++.h>

using namespace std;
ifstream in("biconex.in");
ofstream out("biconex.out");
int n,m,low[100005],idx[100005],nrc,x,y,t,st[100005],k;
vector<int> comp[100005];
vector<int> v[100005];
void dfs(int nod)
{
    low[nod]=t;
    idx[nod]=t;
    ++t;
    st[++k]=nod;
    for(auto it:v[nod])
        if(idx[it]==0)
        {
          dfs(it);
          if(low[it]>=idx[nod])
          {
              nrc++;
              while(st[k]!=it)
              {
                  comp[nrc].push_back(st[k]);
                  k--;
              }
              comp[nrc].push_back(st[k]);
              k--;
              comp[nrc].push_back(nod);
          }
          low[nod]=min(low[it],low[nod]);
        }
        else low[nod]=min(low[nod],idx[it]);
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
        if(idx[i]==0)
        {
          t=0;
          k=0;
          dfs(i);
        }
    out<<nrc<<'\n';
    for(int i=1;i<=nrc;i++)
    {
        for(auto it:comp[i]) out<<it<<" ";
        out<<'\n';
    }
    return 0;
}