#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n,m;
vector <int> lista[50005];
bool ap[50005];
void dfs(int node)
{
    ap[node]=1;
    for(auto x:lista[node])
    {
        if(!ap[x])
            dfs(x);
    }
    out << node << ' ';
}
int main()
{
    in >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        in >> x >> y;
        lista[y].push_back(x);
    }
    for(int i=1; i<=n; i++)
    {
        if(!ap[i])
            dfs(i);
    }
    return 0;
}