#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y,k,i,b[50005],sol[50005];
vector <int> G[50005];
void dfs(int x)
{
    b[x]=1;
    for(int i=0; i<G[x].size(); ++i)
    {
        if(b[G[x][i]]==0)dfs(G[x][i]);
    }
    sol[++k]=x;
}
int main()
{
    f>>n>>m;
    for(i=1; i<=m; ++i)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    for(i=1; i<=n; ++i)
    {
        if(b[i]==0)dfs(i);
    }
    for(i=k; i>=1; --i)g<<sol[i]<<" ";
    return 0;
}