#include <stdio.h>

#define MAX_NODES       50001
#define MAX_EDGES       100001

struct edge_t {
    int node;
    int next;
} edges[MAX_EDGES];

int graph[MAX_NODES], sort[MAX_NODES], in_index[MAX_NODES], s[MAX_NODES], s_it, edge_it = 1, sort_it;

void add_edge(int x, int y)
{
    struct edge_t edge = {y, graph[x]};
    edges[edge_it] = edge;
    graph[x] = edge_it++;
}

int main()
{
    int n, m;

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

    scanf("%d %d", &n, &m);
    while (m--) {
        int x, y;
        scanf("%d %d", &x, &y);
        add_edge(x, y);
        in_index[y]++;
    }

    for (int i = 1; i <= n; i++) {
        if (in_index[i] == 0)
            s[s_it++] = i;
    }

    while (s_it != 0) {
        int node = s[--s_it];

        struct edge_t edge = edges[graph[node]];
        while (edge.node) {
            in_index[edge.node]--;
            if (in_index[edge.node] == 0)
                s[s_it++] = edge.node;
            edge = edges[edge.next];
        }

        sort[sort_it++] = node;
    }

    for (int i = 0; i < n; i++)
        printf("%d ", sort[i]);

    return 0;
}