#include <bits/stdc++.h>
using namespace std;

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

#define cin fin
#define cout fout
/*
*/
const int MAXN=1e6;
int n, m, x, y;
vector<int>nods;
deque<int>coada;
map<int,vector<int>>rel;
vector<int>ordine;
int frecv[MAXN];


void read()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        rel[x].push_back(y);
        frecv[x]++;
    }
}

void print(vector<int> v)
{
    for(auto el:v)
        cout<<el<<" ";
    cout<<"\n";
}

int sortareTopologica()
{
    for(auto el:nods)
    {
        if(!frecv[el])
            coada.push_back(el);
    }
    while(!coada.empty())
    {
        int nod=coada.front();
        ordine.push_back(nod);
        coada.pop_front();
        for(auto el:rel[nod])
        {
            rel[nod].
        }
    }
}


void solve()
{
    sortareTopologica();
    print(ordine);
}

int main()
{
    read();
    solve();

    return 0;
}