#include <bits/stdc++.h>
#define edge pair<int, int>
#define node first
#define cost second
#define oo 0x3f3f3f3f 

using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
int n, m, number;
int dfn[100001], low[100001];
bool viz[100001];
vector<int> graph[100001];
vector<int> components[100001];
stack<int> s;

void read()
{
  f>>n>>m;
  int x, y;
  for(int i = 1;i <= m;++i)
    f>>x>>y, graph[x].push_back(y), graph[y].push_back(x);
}

void dfs(int node, int level)
{
  viz[node] = true;
  dfn[node] = low[node] = level;
  s.push(node);

  for(auto it : graph[node])
    if(viz[it])
      low[node] = min(low[node], dfn[it]);
    else
    {
      dfs(it, level + 1);
      low[node] = min(low[node], low[it]);
      if(low[it] >= dfn[node])
      {
        ++number;
        components[number].push_back(node);
        int x;
        do{
          x = s.top();
          s.pop();
          components[number].push_back(x);
        }while(x != it);
      }
    }
}

void solve()
{
  dfs(1, 1);
  g<<number<<'\n';
  for(int i = 1;i <= number;++i, g<<'\n')
    for(auto it : components[i])
      g<<it<<" ";
}

int main()
{
  read();
  solve();
  return 0;
}