#include <bits/stdc++.h>

using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n, m, number;
vector<int> graf[100001];
vector<int> graft[100001];
bool viz[100001];
vector<int> topo;
vector<int> result[100001];

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

void dfs(int node)
{
  viz[node] = true;

  for(auto it : graf[node])
    if(!viz[it])
      dfs(it);
  
  topo.push_back(node);
}

void dfst(int node)
{
  viz[node] = false;
  result[number].push_back(node);

  for(auto it : graft[node])
    if(viz[it])
      dfst(it);
}

void solve()
{
  for(int i = 1;i <= n;++i)
    if(!viz[i])
      dfs(i);
  
  for(vector<int>::reverse_iterator it = topo.rbegin();it != topo.rend();++it)
    if(viz[(*it)])
      ++number, dfst(*it);

  g<<number<<'\n';
  for(int i = 1;i <= number;++i, g<<'\n')
    for(auto it : result[i])
      g<<it<<" ";
}

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