#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;

#define pb push_back
#define nmax 50010

int N, M, deg[nmax], Q[nmax], X, Y;
vector<int> G[nmax];

void TopSort()
{
     int i;
     vector<int> :: iterator it;
     for(i = 1; i <= N; i++)
           if(deg[i] == 0)
                     Q[++Q[0]] = i;
     for(i = 1; i <= N; i++)
     {
           int aux = Q[i];
           for(it = G[aux].begin(); it != G[aux].end(); ++it)
           {
                  deg[*it] --;
                  if(deg[*it] == 0) Q[++Q[0]] = *it;
           }
     }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    int i;
    scanf("%i %i", &N, &M);
    for(; M; M --)
    {
          scanf("%i %i", &X, &Y);
          G[X].push_back(Y);
          deg[Y] ++;
    }
    TopSort();
    for(i = 1; i <= N; i++) printf("%i ", Q[i]);
    return 0;
}