#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int>L;
vector<int>G[100005];
int viz[100005];
int n,m;
void dfs(int nod)
{
    viz[nod]=1;
    for(auto i:G[nod])
    if(!viz[i]){
        viz[i]=1;
        dfs(i);
    }
    L.push_back(nod);
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    if(!viz[i]){
        viz[i]=1;
        dfs(i);
    }
    for(int i=L.size()-1;i>=0;i--)
        g<<L[i]<<" ";
    return 0;
}