#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,x,y;
vector <int> v[100005];
int ine[100005],nr[100005],q;
void dfs(int x)
{
    for (int i=0;i<v[x].size();i++)
    {
        dfs(v[x][i]);
    }
    nr[++q]=x;
}
int main()
{
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        ine[y]++;
    }
    q=0;
    for (i=1;i<=n;i++)
    {
        if (ine[i]==0)
        {
            dfs(i);
        }
    }
    for (i=q;i>=1;i--)
    {
        g<<nr[i]<<" ";
    }
    return 0;
}