#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[50005];
bool viz[50005];
int nr[50005],q,n,m,i,x,y;
void dfs(int x)
{

    int i,nod;
    viz[x]=1;
    for (i=0; i<v[x].size(); i++)
    {
        nod=v[x][i];
        if (viz[nod]==0)
        {
            dfs(nod);
        }
    }
    nr[++q]=x;
}
int main()
{
    f>>n>>m;
    for (i=1; i<=m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for (i=1;i<=n;i++)
    {
        if (viz[i]==0)
        {
            dfs(i);
        }
    }
    for (i=q; i>=1; i--)
    {
        g<<nr[i]<<" ";
    }
    return 0;
}