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

const int 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);

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i", &X, &Y);
        G[X].push_back(Y);
    }

    for(int i = 1; i <= N; ++ i)
        if(!Used[i])
            DFS(i);

    for(int i = TopSort[0]; i; -- i)
         printf("%i ", TopSort[i]);
}