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

#define Nmax 50010

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

void DFS(int Node)
{
    Used[Node] = 1;
    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++it)
        if(!Used[*it])
            DFS(*it);
    TopSort[++TopSort[0]] = Node;
}

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