# include <iostream>
# include <fstream>
# include <vector>
# include <stack>
# define maxn 50000
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m,viz[maxn], nr=0, post[maxn];
vector <int> a[maxn];

void dfs(int nod)
{
    int k, v;
    viz[nod]=1;
    for(k=0; k<a[nod].size(); k++)
    {
        v=a[nod][k];
        if(!viz[v])
            dfs(v);
    }
    post[++nr]=nod;
}


int main()
{
    int i,x,y;
    f>>n>>m;

    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }

    for(i=1; i<=n; i++)
        if(!viz[i])
            dfs(i);

    for(i=n; i>0; i--)
        g<<post[i]<<" ";

    return 0;
}