#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
vector <int> v[50001];
int deg[50001],afis[50001],cnt;
bool viz[50001];
void dfs(int nod)
{
    viz[nod]=1;
    for(auto it:v[nod])
        if(!viz[it])
        dfs(it);
    afis[++cnt]=nod;
}
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n,m,a,b,i;
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    for(i=cnt;i>=1;i--)
        cout<<afis[i]<<" ";
    return 0;
}