#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

#define N_MAX 50001

int N, M, inDegree[N_MAX];
vector<int> graph[N_MAX];
queue<int> ready;

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

    scanf("%d%d", &N, &M);
    for (int it = 0; it < M; ++it) {
        int s, d;
        scanf("%d%d", &s, &d);
        graph[--s].push_back(--d);
        ++inDegree[d];
    }

    for (int it = 0; it < N; ++it)
        if (0 == inDegree[it]) ready.push(it);
    
    while (!ready.empty()) {
        int current = ready.front();
        ready.pop();
        printf("%d ", 1 + current);
        inDegree[current] = -1;
        for (int it = 0; it < graph[current].size(); ++it) {
            --inDegree[graph[current][it]];
            if (0 == inDegree[graph[current][it]]) {
                ready.push(graph[current][it]);
            }
        }
    }

    return 0;
}