#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[100009];
int n, in[100009], viz[100009];
vector <int> ans;
void dfs (int nod)
{
    viz[nod]=1;
    ans.push_back(nod);
    for (auto y:v[nod])
    {
        if (viz[y]) continue;
        in[y]--;
        if (!in[y])
            dfs (y);
    }
}
signed main ()
{
    f >> n;
    int m;
    f >> m;
    for (int i=1; i<=m; i++)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
        in[y]++;
    }
    for (int i=1; i<=n; i++)
    {
        if (!in[i] && !viz[i])
            dfs (i);
    }
    for (auto nod:ans)
        g << nod << ' ';
}