#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int nmx =  50005;

int n, m;
int val[nmx];
vector <int> G[nmx];
queue <int> Q;

inline void citire(){
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= m; ++i){
        static int x, y;
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
        ++ val[y];
    }
    for(int i = 1; i <= n; ++i )
        if(not val[i])
            Q.push(i);
}

inline void aratare(){
    int a;
    while(not Q.empty()){
        a = Q.front();
        Q.pop();
        printf("%d ", a);
        for(vector<int>::iterator it = G[a].begin(); it != G[a].end(); ++it){
            val[*it] --;
            if(not val[*it])
                Q.push(*it);
        }
    }
}

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

    citire();
    aratare();

    return 0;
}