#include <cstdio>
#include <vector>

int main()
{
    int N, M;
    unsigned base=0;
    int grad[50005]={};
    std::vector<int> graf[50005], Q, sol;

    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d %d", &N, &M);
    for (int i=0; i<M; ++i){
        int x, y;

        scanf("%d %d", &x, &y);
        ++grad[y];
        graf[x].push_back(y);
    }

    for (int i=1; i<=N; ++i){
        if (!grad[i]){
            Q.push_back(i);
        }
    }

    while (base<Q.size()){
        sol.push_back(Q[base]);

        for (unsigned i=0; i<graf[Q[base]].size(); ++i){
            --grad[graf[Q[base]][i]];
            if (!grad[graf[Q[base]][i]]){
                Q.push_back(graf[Q[base]][i]);
            }
        }
        ++base;
    }
    for (unsigned i=0; i<sol.size(); ++i){
        printf("%d ", sol[i]);
    }
    return 0;
}