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

int n, m, x, y;
int viz[50005];
vector <int> graph[50005];
stack <int> S;

void sortaretopologica(int i){
    for(auto &v:graph[i]){
        if(viz[v]==0){
            viz[v]=1;
            sortaretopologica(v);
        }
    }
    S.push(i);
}
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);
    }
    for(int i=1; i<=n; i++){
        if(viz[i]==0){
            viz[i]=1;
            sortaretopologica(i);
        }

    }
    while(!S.empty()){
        printf("%d ", S.top());
        S.pop();
    }
    return 0;
}