#include <bits/stdc++.h>

#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif

template <typename T, typename U>
bool chmin(T &a, const U &b){
  return (a > b ? a = b, true : false);
}

template <typename T, typename U>
bool chmax(T &a, const U &b){
  return (a < b ? a = b, true : false);
}

template <typename T, size_t N, typename U>
void fill_array(T (&a)[N], const U &v){
  std::fill((U*)a, (U*)(a + N), v);
}

template <typename T, size_t N, size_t I = N>
auto make_vector(const std::array<int, N> &a, T value = T()){
  static_assert(I >= 1);
  static_assert(N >= 1);
  if constexpr (I == 1){
    return std::vector<T>(a[N - I], value);
  }else{
    return std::vector(a[N - I], make_vector<T, N, I - 1>(a, value));
  }
}

template <typename T>
std::ostream& operator<<(std::ostream &s, const std::vector<T> &a){
  for(auto it = a.begin(); it != a.end(); ++it){
    if(it != a.begin()) s << " ";
    s << *it;
  }
  return s;
}

template <typename T>
std::istream& operator>>(std::istream &s, std::vector<T> &a){
  for(auto &x : a) s >> x;
  return s;
}

/**
 * @title Basic graph
 * @docs graph.md
 */
namespace haar_lib {
  template <typename T>
  struct edge {
    int from, to;
    T cost;
    int index = -1;
    edge(){}
    edge(int from, int to, T cost): from(from), to(to), cost(cost){}
    edge(int from, int to, T cost, int index): from(from), to(to), cost(cost), index(index){}
  };

  template <typename T>
  struct graph {
    using weight_type = T;
    using edge_type = edge<T>;

    std::vector<std::vector<edge<T>>> data;

    auto& operator[](size_t i){return data[i];}
    const auto& operator[](size_t i) const {return data[i];}

    auto begin() const {return data.begin();}
    auto end() const {return data.end();}

    graph(){}
    graph(int N): data(N){}

    bool empty() const {return data.empty();}
    int size() const {return data.size();}

    void add_edge(int i, int j, T w, int index = -1){
      data[i].emplace_back(i, j, w, index);
    }

    void add_undirected(int i, int j, T w, int index = -1){
      add_edge(i, j, w, index);
      add_edge(j, i, w, index);
    }

    template <size_t I, bool DIRECTED = true, bool WEIGHTED = true>
    void read(int M){
      for(int i = 0; i < M; ++i){
        int u, v; std::cin >> u >> v;
        u -= I;
        v -= I;
        T w = 1;
        if(WEIGHTED) std::cin >> w;
        if(DIRECTED) add_edge(u, v, w, i);
        else add_undirected(u, v, w, i);
      }
    }
  };

  template <typename T>
  using tree = graph<T>;
}

/**
 * @title Strongly connected components
 * @docs strongly_connected_components.md
 */
namespace haar_lib {
  template <typename T>
  auto strongly_connected_components(const graph<T> &g){
    const int n = g.size();

    std::vector<bool> visit(n);
    std::vector<int> check(n);
    std::vector<int> result(n, -1);

    auto dfs =
      [&](auto &f, int cur) -> void {
        visit[cur] = true;
        for(const auto &e : g[cur]){
          if(not visit[e.to]) f(f, e.to);
        }
        check.push_back(cur);
      };

    for(int i = 0; i < n; ++i) if(not visit[i]) dfs(dfs, i);

    std::reverse(check.begin(), check.end());

    graph<T> rg(n);

    auto rdfs =
      [&](auto &f, int cur, int i) -> void {
        result[cur] = i;
        for(const auto &e : rg[cur]){
          if(result[e.to] == -1) f(f, e.to, i);
        }
      };

    for(int i = 0; i < n; ++i) for(const auto &e : g[i]) rg[e.to].emplace_back(e.to, e.from, e.cost);

    int i = 0;
    for(auto c : check) if(result[c] == -1) rdfs(rdfs, c, i), ++i;

    return std::make_pair(result, i);
  }
}

/**
 * @title Topological sort
 * @docs topological_sort.md
 */
namespace haar_lib {
  template <typename T>
  std::optional<std::vector<int>> topological_sort(const graph<T> &g){
    const int n = g.size();
    std::vector<int> indeg(n);

    for(int i = 0; i < n; ++i){
      for(auto &e : g[i]){
        ++indeg[e.to];
      }
    }

    std::queue<int> q;
    for(int i = 0; i < n; ++i){
      if(indeg[i] == 0) q.push(i);
    }

    std::vector<int> ret;
    while(not q.empty()){
      int cur = q.front(); q.pop();
      ret.push_back(cur);
      for(auto &e : g[cur]){
        --indeg[e.to];
        if(indeg[e.to] == 0){
          q.push(e.to);
        }
      }
    }

    if((int)ret.size() == n){
      return {ret};
    }else{
      return std::nullopt;
    }
  }
}

/**
 * @docs join.md
 */
namespace haar_lib {
  template <typename Iter>
  std::string join(Iter first, Iter last, std::string delim = " "){
    std::stringstream s;

    for(auto it = first; it != last; ++it){
      if(it != first) s << delim;
      s << *it;
    }

    return s.str();
  }
}



namespace solver {
  namespace hl = haar_lib;

  void init(){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(12);
    std::cerr << std::fixed << std::setprecision(12);
    std::cin.exceptions(std::ios_base::failbit);
  }

  void solve(){
    int N, M; std::cin >> N >> M;

    hl::graph<int> g(N);
    g.read<0, true, false>(M);

    auto [scc, K] = hl::strongly_connected_components(g);
    std::vector<std::vector<int>> ans(K);
    for(int i = 0; i < N; ++i) ans[scc[i]].push_back(i);

    hl::graph<int> g2(K);
    for(auto &v : g){
      for(auto &e : v){
        if(scc[e.from] != scc[e.to]) g2.add_edge(scc[e.from], scc[e.to], 1);
      }
    }

    auto ts = hl::topological_sort(g2).value();

    std::cout << K << "\n";

    for(auto i : ts){
      auto &t = ans[i];
      std::cout << t.size() << " " << hl::join(t.begin(), t.end()) << "\n";
    }
  }
}

int main(){
  solver::init();
  while(true){
    try{
      solver::solve();
    }catch(const std::istream::failure &e){
      break;
    }
  }
  return 0;
}


Measured memory_bytes: 91080