#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int NMAX = 50005;
int n, m;
vector<int> ans;
vector<vector<int>> graph;
bitset<NMAX> used;
void dfs(int node)
{
    used[node] = 1;
    for (int neighbour : graph[node])
        if (!used[neighbour])
            dfs(neighbour);
    ans.push_back(node);
}
void TopSort()
{
    for (int i = 1; i <= n; i++)
        if (!used[i])
            dfs(i);
    reverse(ans.begin(), ans.end());
}
int main()
{
    f >> n >> m;
    graph.resize(n + 1);

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        graph[x].push_back(y);
    }

    TopSort();

    for (int node : ans)
        g << node << ' ';
    return 0;
}