#include <iostream>
#include <vector>
#include <fstream>
#include <stack>

using namespace std;

int n,m;
vector<int> L[50005];
stack<int> REZ;
int U[50005];

ifstream in("sortaret.in");
ofstream out("sortaret.out");

void read(){
    int x,y;
    in>>n>>m;
    for(int i=1;i<=m;i++){
        in>>x>>y;
        L[x].push_back(y);
    }
}
void dfs(int st){
    U[st]=1;
    for(auto x : L[st]){
        if(!U[x])
            dfs(x);
    }
    REZ.push(st);
}
void solve(){
    for(int i=1;i<=n;i++){
        if(!U[i])
            dfs(i);
    }
    while(!REZ.empty()){
        out<<REZ.top()<<" ";
        REZ.pop();
    }
}
int main(){
    read();
    solve();
    return 0;
}