#include<iostream>
#include<cstdio>
#include<vector>
#include<bitset>
using namespace std;
constexpr int N=50005;
int n,m;
bitset<N>mp[N],rmp[N];
bitset<N>vis;
int out[N],ind;
void dfs(int x)
{
    bitset<N> now;vis[x]=1;
    for(now=mp[x]^(mp[x]&vis);now.any();now=mp[x]^(mp[x]&vis))
        dfs(now._Find_first());
    out[++ind]=x;
}
vector<int>pos;
vector<vector<int>>block;
int tot;
void dfsrev(int x)
{
    pos.push_back(x);
    bitset<N> now;vis[x]=1;
    for(now=rmp[x]^(rmp[x]&vis);now.any();now=rmp[x]^(rmp[x]&vis))
    {
        dfsrev(now._Find_first());
    }
    return;
}
int kosaraju()
{
    vis.reset();ind=0;
    for(int i=1;i<=n;++i) if(!vis[i]) dfs(i);
    vis.reset();int res=0;
    for(int i=n,x;i;--i) if(!vis[out[i]])
    {
        pos.clear();
        dfsrev(out[i]);
        tot++;
        block.emplace_back(pos);
    }
    return res;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v;
        cin>>u>>v;
        u++,v++;
        mp[u][v]=1;
        rmp[v][u]=1;
    }
    cerr<<"ed\n";
    kosaraju();
    cout<<tot<<"\n";
    for(int i=0;i<tot;i++)
    {
        int l=block[i].size();
        cout<<l;
        for(int u:block[i])
            cout<<" "<<u-1;
        cout<<"\n";
    }
    return 0;
}