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

using namespace std;

const int Nmax=50001;
vector <int> v[Nmax];
int grad[Nmax],m,n,x,y,viz[Nmax];

ofstream out("sortaret.out");

void dfs(int a)
{
    for(int k=0; k<v[a].size(); k++)
    {
        if(viz[v[a][k]]==0)
        {
            viz[v[a][k]]=1;
            grad[v[a][k]]--;
            if(grad[v[a][k]]==0)
                out<<v[a][k]<<" ";
            dfs(v[a][k]);
        }
    }
}

int main()
{
    ifstream in("sortaret.in");
    in>>n>>m;
    for(int i=0; i<m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1; i<=n; i++)
    {
        if(grad[i]==0 && viz[i]==0)
        {
            out<<i<<" ";
            dfs(i);
        }

    }
    in.close();
    out.close();
    return 0;
}