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

#define Nmax 50010
#define PB push_back
#define IT vector<int> :: iterator

int N, M, X, Y, Top[Nmax], Used[Nmax];
vector<int> G[Nmax];

void DFS(int Node)
{
    Used[Node] = 1;
    for(IT it = G[Node].begin(); it != G[Node].end(); ++it)
        if(!Used[*it])
            DFS(*it);
    Top[++Top[0]] = Node;
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; i++)
        scanf("%i %i", &X, &Y), G[X].PB(Y);
    for(int i = 1; i <= N; i++)
        if(!Used[i])
            DFS(i);
    for(int i = Top[0]; i; i--) printf("%i ", Top[i]);
    return 0;
}