#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

int N, M, grad[50000];
queue <int> Q[50000];
vector <int> G[50000];

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

void sortare{
        int i, x;
        vector <int>::iterator it;

        for (i = 0; i < N; i++)
        if (grad[x] == 0)
        Q[++Q[0]] = i;

        for (i = 0; i < N; i++)
        {
            x = Q[i];
            for (it = G[x].begin(); it != G[x].end(); it++)
            {
                grad[*it]--;
                if (grad[it *] == 0)
                    Q[++Q[0]] = *it;
            }
        }
}

void citire{
        in >> N >> M;

        for(int i = 0; i < M; i++){
            int a, b;
            in >> a >> b;
            G[a].push_back(b);
            grad[b]++;
        }
}

void afisare{
        for(int i = 0; i < N; i++)
        out << Q[i] << " ";
}

int main() {

    citire();
    sortare();
    afisare();
    return 0;
}