#include <bits/stdc++.h>
#define pb push_back

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int N=50009;
int n,m,d[N],sol[N],k;
vector <int> v[N];
void dfs(int nod)
{
    d[nod]=1;
    for(auto it:v[nod])
        if(!d[it])
            dfs(it);
    sol[++k]=nod;
}
int main()
{
    fin.sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].pb(y);
    }
    for(int i=1;i<=n;i++)
    {
        if(!d[i])
            dfs(i);
    }
    for(int i=n;i>=1;i--)
        fout<<sol[i]<<" ";
    return 0;
}