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

int dx[50005];
int n, m, x, y;

vector <int> graph[50005];
queue <int> Q;

void sortaretopologica(){
    while(!Q.empty()){

        int x=Q.front();
        for(auto &v:graph[x]){
            dx[v]--;
            if(dx[v]==0)
                Q.push(v);
        }
        printf("%d ", x);
        Q.pop();
    }

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

    scanf("%d %d", &n, &m);
    for(int i=1; i<=m; i++){
        scanf("%d %d", &x, &y);
        graph[x].push_back(y);
        dx[y]++;
    }
    for(int i=1; i<=n; i++){
        if(dx[i]==0)
            Q.push(i);
    }
    sortaretopologica();
    return 0;
}