#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int MAXN = 1 * 1e5 + 5;
vector <int> g[MAXN];
vector <int> ans;
bool seen[MAXN];
void dfs(int node){
    if(seen[node]) return ;
    seen[node] = true;
    for(auto x : g[node]){
            dfs(x);

    }
    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);
    }
    dfs(1);
    for(int i = ans.size() - 1; i >= 0; --i)
        fout << ans[i] << " " ;
    return 0;
}