#include <bits/stdc++.h>
#define DEBUG(x) cerr << (#x) << ": " << (x) << '\n'

using namespace std;

void addBiconnectedComponent(int x, int y, 
  vector<pair<int, int>> &stk, vector<vector<int>> &biconnected) {
  
  int a, b;
  biconnected.emplace_back();
  do {
    tie(a, b) = stk.back();
    stk.pop_back();
    biconnected.back().emplace_back(a);
    biconnected.back().emplace_back(b);
  } while (a != x || b != y);
}

void dfs(int node, int parent, vector<int> &depth, vector<int> &low, 
  vector<pair<int, int>> &stk, vector<vector<int>> &adj, vector<vector<int>> &biconnected) {
  
  low[node] = depth[node];
  for (int &x : adj[node]) if (x != parent) {
    if (depth[x] == -1) {
      depth[x] = depth[node] + 1;
      stk.emplace_back(node, x);
      dfs(x, node, depth, low, stk, adj, biconnected);
      low[node] = min(low[node], low[x]);
      if (low[x] >= depth[node]) {
        addBiconnectedComponent(node, x, stk, biconnected);
      }
    } else {
      low[node] = min(low[node], depth[x]);
    }
  }
}

int main() {
  freopen("biconex.in", "r", stdin);
  freopen("biconex.out", "w", stdout);
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, m; cin >> n >> m;
  vector<vector<int>> adj(n);
  for (int i = 0; i < m; ++i) {
    int u, v; cin >> u >> v;
    --u, --v;
    adj[u].emplace_back(v);
    adj[v].emplace_back(u);
  }
  vector<vector<int>> biconnected;
  vector<int> depth(n, -1), low(n);
  for (int i = 0; i < n; ++i) {
    if (depth[i] == -1) {
      vector<pair<int, int>> stk;
      depth[i] = 0;
      dfs(i, -1, depth, low, stk, adj, biconnected);
    }
  }
  cout << biconnected.size() << endl;
  for (auto &comp : biconnected) {
    sort(comp.begin(), comp.end());
    comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
    for (int node : comp) {
      cout << node + 1 << ' ';
    }
    cout << '\n';
  }

#ifdef LOCAL_DEFINE
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}