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

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> G[50005];
int grad[50005];
priority_queue <int> Q;
int n,m;
void citire()
{   int x,y;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        grad[y]++;

    }
}
void sortare()
{
    while(!Q.empty())
    {
        int x=Q.top();
        Q.pop();
        fout<<x<<" ";
        for(auto &v: G[x])
        {   grad[v]--;
            if(grad[v]==0)
                Q.push(v);
        }

    }
}
int main()
{
    citire();
    for(int i=1; i<=n; i++)
        if(grad[i]==0) Q.push(i);
    sortare();
    return 0;
}