#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define N 50000
#define M 100000

typedef struct
{
    int vf, urm;
} element;

int lst[N+1], nr, n, m, s[N+1], ns;
bool viz[N+1];
element v[2*M+1];

void adauga(int x, int y)
{//adauga pe y in lista de adiacenta a lui x
    v[++nr].vf = y;
    v[nr].urm = lst[x];
    lst[x] = nr;
}

void dfs_rec(int x)
{
    viz[x] = true;
    for (int p = lst[x]; p != 0; p = v[p].urm)//parcurgerea succesorilor lui x
    {
        int y = v[p].vf;
        if (!viz[y])
        {
            dfs_rec(y);
        }
    }
    s[++ns] = x;//nu mai exista varfuri accesibile din x nevizitate
}

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