#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

long long N,M,X,Y;

vector<vector<long long>>a;
vector<long long>top;
vector<bool>viz;

void dfs(long long nod)
{ 
   viz[nod]=1;

   for(long long i=1;i<=N;i++)
      if(a[nod][i]==1 && viz[i]==0)dfs(i);
    
   top.push_back(nod);   
}

int main()
{
    fin>>N>>M;
    
    a.resize(N + 1, vector<long long>(N + 1, 0));
    viz.resize(N+1);

    for(long long i=0;i<M;i++)
    {
        long long x,y;
        fin>>x>>y;
        a[x][y]=1;
    }

    for(long long i=0;i<N;i++)
    {
        if(!viz[i])dfs(i);
    }

    reverse(top.begin(),top.end());

    for(long long i=0;i<N;i++)fout<<top[i]<<" ";
    
    fin.close();
    fout.close();
    return 0;
}