#include <fstream>
#include <algorithm>
#include <vector>
#define MAX 50000
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int ans[MAX + 10], vis[MAX + 10], cnt;
vector <int> graph[MAX + 10];
void dfs(int node)
{
    vis[node] = 1;
    for (const auto &next : graph[node])
        if (vis[next] == 0)
            dfs(next);
    cnt++;
    ans[cnt] = node;
}
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        cin >> x >> y;
        graph[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        if (vis[i] == 0)
            dfs(i);
    reverse(ans + 1, ans + n + 1);
    for (int i = 1; i <= n; i++)
        cout << ans[i] << ' ';
    return 0;
}