#include <stdio.h>
#include <stdlib.h>
#define NMAX 50000
#define FIN "sortaret.in"
#define FOUT "sortaret.out"

enum colors {WHITE, GRAY, BLACK};

int m, n, time, tail = 1;
int *A[NMAX], color[NMAX], prev[NMAX], d[NMAX], f[NMAX], Q[NMAX];

void read();
void DFS();
void DFS_Visit(int u);

void read()
{
     int x, y, i; 
     scanf("%d %d", &n, &m);
     for (i=1; i<=n; ++i) {
         A[i] = (int*)malloc(sizeof(int));
         A[i][0] = 0;
     }
     for (i=1; i<=m; ++i) {
         scanf("%d %d", &x, &y);
         ++A[x][0];
         A[x] = (int*)realloc(A[x], (A[x][0]+1)*sizeof(int));
         A[x][A[x][0]] = y;
     }
}

void DFS()
{
     int i;
     for (i=1; i<=n; i++) {
         color[i] = WHITE;
         prev[i] = 0;
     }
     time = 0;
     for (i=1; i<=n; ++i)
         if (color[i] == WHITE)
            DFS_Visit(i);
}

void DFS_Visit(int u)
{
     int i;
     color[u] = GRAY;
     d[u] = ++time;
     for (i=1; i<=A[u][0]; ++i)
         if (color[A[u][i]] == WHITE) {
                            prev[A[u][i]] = u;
                            DFS_Visit(A[u][i]);
         }
     color[u] = BLACK;
     f[u] = ++time;
     Q[tail++] = u;
}

int main()
{
    freopen(FIN, "r", stdin);
    freopen(FOUT, "o", stdout);
    int i;
    read();
    DFS();
    for (i = tail-1; i >= 1; --i)
        printf("%d ", Q[i]);
    system("pause");
    return 0;
}