#include <bits/stdc++.h>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int n, m, i, j, nr, cnt;
bool v[100002], v2[100002];
vector <int> S, a[100002], b[100002], ctc[100002];
void DFS_1(int nod)
{
v2[nod] = 1;
for (auto it : a[nod])
if (!v2[it])
DFS_1(it);
S.push_back(nod);
}
void DFS_2(int nod)
{
v[nod] = 1;
nr++;
for (auto it : b[nod])
if (!v[it])
DFS_2(it);
ctc[cnt].emplace_back(nod);
}
int main()
{
f >> n >> m;
while (m--)
{
f >> i >> j;
a[i].emplace_back(j);
b[j].emplace_back(i);
}
for (i = 1; i <= n; i++)
if (v2[i] == 0)
DFS_1(i);
for (i = S.size() - 1; i >= 0; i--)
if (!v[S[i]])
cnt++, nr = 0, DFS_2(S[i]);
g << cnt << endl;
for (i = 1; i <= cnt; i++)
{
for (auto it : ctc[i])
g << it << " ";
g << "\n";
}
return 0;
}