#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,d[50005];
vector <int> v[50005],ans;
void dfs(int nod)
{
    for (int i : v[nod])
    {
        if (!d[i])
        {
            d[i]=1;
            dfs(i);
        }
    }
    ans.push_back(nod);
}
int main()
{
    fin>>n>>m;
    for (int i=1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        v[a].push_back(b);
    }
    for (int i=1;i<=n;i++)
    {
        if (!d[i])
        {
            d[i]=1;
            dfs(i);
        }
    }
    for (int i=ans.size()-1;i>=0;i--)
        fout<<ans[i]<<' ';
    return 0;
}