#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int MAXN = 5 * 1e4 + 10;
bool viz[MAXN];
vector <int> g[MAXN];
vector <int> ans;
void dfs(int node){
    if(viz[node]) return;
    viz[node] = true;
    for(auto y : g[node]){
        dfs(y);
    }
    ans.push_back(node);
}
int main(){
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i) dfs(i);
    for(int i = ans.size() - 1; i >= 0; --i)
        fout << ans[i] << " ";
    return 0;
}