#include <bits/stdc++.h>

using namespace std;

#define INFILE "sortaret.in"
#define OUTFILE "sortaret.out"

const int N_MAX = 5 * 1e4;

int n, m;
bool visited[N_MAX + 5];
vector<int> adj[N_MAX + 5];

vector<int> ans;

void dfs(int node){
    visited[node] = true;
    for(auto &to : adj[node]) {
        if(!visited[to]) dfs(to);
    }
    ans.push_back(node);
}

void topologicalSort(){
    memset(visited, false, sizeof(visited));
    ans.clear();
    for(int i = 1; i <= n; ++i){
        if(!visited[i]) dfs(i);
    }
    reverse(ans.begin(), ans.end());
}

void solve(){

    cin >> n >> m;

    for(int i = 0; i < m; ++i){
        int node, to; cin >> node >> to;
        adj[node].push_back(to);
    }

    topologicalSort();
    
    for(auto &it : ans) cout << it << " ";
    cout << '\n';

}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    solve();
    return 0;
}