#include <bits/stdc++.h>

using namespace std;

ifstream in ("sortaret.in");
ofstream out ("sortaret.out");

int n, m, x, y;
vector <int> g[50005];
vector <int> sol;
bitset <50005> v;

void dfs(int x)
{
    v[x]=1;
    for (int i=0; i<g[x].size(); i++)
        if (!v[g[x][i]])
            dfs(g[x][i]);
    sol.push_back(x);
}

int main()
{
    in >> n >> m;
    for (int i=1; i<=m; i++)
    {
        in >> x >> y;
        g[x].push_back(y);
    }
    for (int i=1; i<=n; i++)
        if (!v[i])
            dfs(i);
    for (int i=sol.size()-1; i>=0; i--)
        out << sol[i] << " ";
    return 0;
}