#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int nmax=100005;
bool viz[nmax];
int i,j,n,m,k,sol[nmax],x,y;
vector <int>v[nmax];
void dfs(int nod)
{
    viz[nod]=1;
    for(auto it:v[nod])
        if(!viz[it])
            dfs(it);
        sol[++k]=nod;
}
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])dfs(i);
    for(i=n;i>=1;i--)
        g<<sol[i]<<' ';
    return 0;
}