#include <bits/stdc++.h>
using namespace std;
#define pb push_back

int n,m;
vector <int> V[50010],Sol;
bool u[50010];

void dfs(int q){
    if (u[q]) return;
    u[q]=true;
    for (int i=0; i<V[q].size(); i++){
        dfs(V[q][i]);
    }
    Sol.pb(q);
}

int main(){
    ifstream cin ("sortaret.in");
    ofstream cout ("sortaret.out");
    cin>>n>>m;
    for (int i=1; i<=m; i++){
        int x,y;
        cin>>x>>y;
        V[x].pb(y);
    }
    for (int i=1; i<=n; i++){
        if (!u[i]) dfs(i);
    }
    for (int i=Sol.size()-1; i>=0; i--) cout<<Sol[i]<<" ";
    return 0;
}