#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<vector<int>> v(50005);
vector<int> sor(50005);
bool viz[50005];
void dfs(int nod)
{
    viz[nod]=true;
    for(auto it : v[nod])
        if(!viz[it])
            dfs(it);
    sor.push_back(nod);
}
int main()
{
    int n,m,a,b;
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    reverse(sor.begin(),sor.end());
    for(int i=0;i<n;i++)
        out<<sor[i]<<" ";
    return 0;
}