#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
int i,j,m,n,x,y,nr,afis[100000],k;
bool ok[100000],ok1[100000];
vector <int> v[100000],r[100000];
stack <int> Q,Q1;
void df1(int x)
{
    vector <int> ::iterator it;
    ok1[x]=true; afis[++k]=x;
    for(it=r[x].begin(); it!=r[x].end(); it++)
    if(!ok1[*it])
    df1(*it);

}
void df(int x)
{
    vector <int> ::iterator it;
    ok[x]=true; Q.push(x);
    for(it=v[x].begin(); it!=v[x].end(); it++)
    if(!ok[*it]) df(*it);

}
int main()
{
    freopen("ctc.in","r",stdin);
    freopen("ctc.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
        r[y].push_back(x);
    }
    for(i=1; i<=n; i++)
    if(!ok[i])
    {
        df(i);nr++;
        while(!Q.empty())
        {
            Q1.push(Q.top());
            Q.pop();
        }
    }
    k=1;
    while(!Q1.empty())
    {
        x=Q1.top();
        if(!ok1[x]) {++k;afis[1]++;df1(x);}
        Q1.pop();
    }
    for(i=1; i<=k; i++)
    if(afis[i]==0) printf("\n");
    else printf("%d ",afis[i]);


    return 0;
}