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

typedef struct
{
    int vf, urm;
} element;

element v[M+1];
int n, m, nv, nst, lst[N+1], sort_top[N+1];
bool viz[N+1];

void adauga(int x, int y)
{
    ///il adauga pe y in lista succesorilor lui x
    nv++;
    v[nv].vf = y;
    v[nv].urm = lst[x];
    lst[x] = nv;
}

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

void inversare()
{
    int st = 1, dr = nst;
    while (st < dr)
    {
        int aux = sort_top[st];
        sort_top[st] = sort_top[dr];
        sort_top[dr] = aux;
        st++;
        dr--;
    }
}

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(i);
        }
    }
    inversare();
    for (int i = 1; i <= n; i++)
    {
        fprintf(out, "%d ", sort_top[i]);
    }
    fclose(in);
    fclose(out);
    return 0;
}