#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define N 50001
#define M 100001

typedef struct
{
    int vf, urm;
} element;

int q[N], st, dr, nrp[N], lst[N], nr;
element succesori[M];

void adauga_succesor(int x, int y)
{
    ++nr;
    succesori[nr].vf = y;
    succesori[nr].urm = lst[x];
    lst[x] = nr;
}

int main()
{
    FILE *in, *out;
    in = fopen("sortaret.in", "r");
    out = fopen("sortaret.out", "w");
    int n, m, i;
    fscanf(in, "%d%d", &n, &m);
    for (i = 0; i < m; i++)
    {
        int x, y;
        fscanf(in, "%d%d", &x, &y);
        nrp[y]++;
        adauga_succesor(x, y);
    }
    fclose(in);
    st = 0;
    dr = -1;
    for (i = 1; i <= n; i++)//initializez vectorul de sitante
    {
        if (nrp[i] == 0)
        {
            q[++dr] = i;
        }
    }
    while (st <= dr)//cat timp coada NU e vida
    {
        int x = q[st++];//il scot pe x din coada
        fprintf(out, "%d ", x);
        int p = lst[x];//cu ajutorul lui p voi parcurge lista succesorilor lui x
        while (p != 0)//parcurg vecinii (posibili) ai lui x
        {
            int y = succesori[p].vf;
            nrp[y]--;
            if (nrp[y] == 0)//y nu mai are predecesori, deci poate fi adugat in q
            {
                q[++dr] = y;//il adaug in coada q
            }
            p = succesori[p].urm;
        }
    }
    fclose(out);
    return 0;
}