#include<iostream>
#include<vector>
#include<fstream>
#include<stack>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<int>g[100005];
int dfn[100005],low[100005],timp;
bool in_st[100005];
stack<int>st;
vector<vector<int>>ctc;
void dfs(int u){
dfn[u]=low[u]=++timp;
st.push(u);
in_st[u]=true;
for(int v:g[u])
{
if(!dfn[v]){
dfs(v);
low[u]=min(low[u],low[v]);
}
else if(in_st[v]){
low[u]=min(low[u],dfn[v]);
}
}
if(low[u]==dfn[u])
{
vector<int>comp;
while(true){
int nod=st.top();
st.pop();
in_st[nod]=false;
comp.push_back(nod);
if(nod==u)
break;
}
ctc.push_back(comp);
}
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=0;i<m;++i){
int u,v;
fin>>u>>v;
g[u].push_back(v);
}
for(int i=1;i<=n;++i)
{
if(!dfn[i])
dfs(i);
}
fout<<ctc.size()<<"\n";
for(int i=0;i<ctc.size();++i){
for(int j=0;j<ctc[i].size();++j)
fout<<ctc[i][j]<<" ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}