#include <stdio.h>
#include <stdbool.h>

#define N 50000
#define M 100000
#define NIL (-1)

struct element {
    int varf, urm;
};

typedef struct element element;

element v[M];
int lst[N+1], nr_v, q[N], stiva[N], vf;
bool viz[N+1];

void adauga(int x, int y) {
    // il adaugam pe y in lista de succesori a lui x
    v[nr_v].varf = y;
    v[nr_v].urm = lst[x];
    lst[x] = nr_v++;
}

void dfs(int x) {
    viz[x] = true;
    for (int p = lst[x]; p != NIL; p = v[p].urm) {
        int y = v[p].varf;
        if (!viz[y]) {
            dfs(y);
        }
    }
    stiva[vf++] = x;
}

int main() {
    FILE *in, *out;
    in = fopen("sortaret.in", "r");
    out = fopen("sortaret.out", "w");
    int m, n;
    fscanf(in, "%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        lst[i] = NIL;
    }
    for (int i = 0; i < m; i++) {
        int x, y;
        fscanf(in, "%d%d", &x, &y);
        adauga(x, y);
    }
    fclose(in);
    for (int i = 1; i <= n; i++) {
        if (!viz[i]) {
            dfs(i);
        }
    }
    while (vf != 0) {
        fprintf(out, "%d ", stiva[--vf]);
    }
    fprintf(out, "\n");
    fclose(out);
    return 0;
}