#include <stdio.h>
#include <stdlib.h>

int N,M;
int * A[50001], S[50000], K;
bool vis[50001];

void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d %d",&N,&M);

    for(int i = 1 ; i <= N; ++i)
    {
       A[i] = (int*) malloc(sizeof(int));
       A[i][0] = 0;
    }

    for(int i = 0 ; i < M; ++i)
    {
     int u,v;
     scanf("%d %d",&u,&v);

     A[u][0] ++;

     A[u] = (int*) realloc(A[u], (A[u][0] + 1) * sizeof(int));

     A[u][A[u][0]] = v;
    }
}

void dfs(int i)
{
 vis[i] = 1;
 for(int j = 1; j <= A[i][0]; ++j)
   if(!vis[A[i][j]])
    dfs(A[i][j]);
 S[K++] = i;
}

void tsort()
{
 for(int i = 1; i <= N; ++i)
    if(!vis[i])
      dfs(i);

 freopen("sortaret.out","w",stdout);
 for(int i = N - 1; i >= 0; --i)
   printf("%d ",S[i]);
}

int main()
{
 citire();
 tsort();
 return 0;
}