#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#define MAXN 50050

using namespace std;

vector<int> graf[MAXN], sol;
queue<int> q;
int n, m;
int grad[MAXN];

void read()
{
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= m; i++) {
        int x, y;
        scanf("%d %d", &x, &y);
        graf[x].push_back(y);
        grad[y]++;
    }
}

void solve()
{
    for (int i = 1; i <= n; i++)
        if (grad[i] == 0)
            q.push(i);
    while (!q.empty()) {
        int top = q.front();
        q.pop();
        sol.push_back(top);
        for (int y : graf[top])
            if (--grad[y] == 0)
                q.push(y);
    }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    read();
    solve();
    for (int y : sol) printf("%d ", y);

    return 0;
}