#include <iostream>
#include <fstream>
#include <list>
#include <vector>
#include <iterator>
#include <queue>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
list<int> a[100005];
vector<int> ans;
queue<int> Q;
vector<int> F;
void Read();
void Solve();
void PrintAns();

int main()
{
    Read();
    Solve();
    PrintAns();
    return 0;
}

void PrintAns()
{
    for(int i = 0; i < n; ++i)
        fout << ans[i] << ' ';
    return;
}


void Solve()
{
    F.clear();
    F.resize(n + 1, 0);
    list<int> :: iterator it;
    for (int i = 1; i <= n; ++i)
    {
        for(it = a[i].begin(); it != a[i].end(); ++it)
            F[(*it)]++;
    }
    for (int i = 1; i <= n; ++i)
    {
        cout << F[i];
        if(F[i] == 0)
            Q.push(i);
    }
    while(!Q.empty())
    {
        int N = Q.front();
        Q.pop();
        ans.push_back(N);
        cout << '\n' << N;
        for(it = a[N].begin(); it != a[N].end(); ++it)
        {
            --F[(*it)];

            //a[N].erase(it);
            if(F[(*it)] == 0)
                Q.push((*it));
            //a[N].remove(*it);
        }
        a[N].resize(0);
    }
}

void Read()
{
    int x, y;
    fin >> n >> m;

    for (int i = 0; i < m; ++i)
    {
        fin >> x >> y;
        a[x].push_front(y);
    }
    list<int> :: iterator it;
    for (int i = 1; i <= n; ++i)
    {
        cout << i << ": ";
        for(it = a[i].begin(); it != a[i].end(); ++it)
            cout << *it << ' ';
        cout << '\n';
    }
}