#include <fstream>
#include <vector>
#include <queue>
#define MAX 50000
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int deg[MAX + 10], ans[MAX + 10];
vector <int> graph[MAX + 10];
queue <int> q;
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);
        deg[y]++;
    }
    int cnt = 0;
    for (int i = 1; i <= n; i++)
        if (deg[i] == 0)
        {
            q.push(i);
            cnt++;
            ans[cnt] = i;
        }
    while (cnt < n)
    {
        int node = q.front();
        q.pop();
        for (const auto &next : graph[node])
        {
            if (deg[next] > 0)
                deg[next]--;
            if (deg[next] == 0)
            {
                q.push(next);
                cnt++;
                ans[cnt] = next;
            }
        }
    }
    for (int i = 1; i <= n; i++)
        cout << ans[i] << ' ';
    return 0;
}