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

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

void dfs(int q){
    Q.push(q);
    u[q]=true;
    for (int i=0; i<V[q].size(); i++){
        if (!u[V[q][i]]) dfs(V[q][i]);
    }
}

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);
    }
    while (!Q.empty()){
        int x;
        x=Q.front();
        cout<<x<<" ";
        Q.pop();
    }
    return 0;
}