#include <bits/stdc++.h>
#define ll long long
//#define int ll
using namespace std;
ifstream in ("sortaret.in");
ofstream out ("sortaret.out");
int n, m;
vector <int> ans;
vector <int> v[50001];
bool viz[50001];
void dfs (int nod)
{
    viz[nod] = 1;
    ans.push_back(nod);
    for (auto i:v[nod])
        if (!viz[i])
            dfs(i);
}
main()
{
    in >> n >> m;
    for (int i = 1;i<=m;++i)
    {
        int a, b;
        in >> a >> b;
        v[a].push_back(b);
    }
    dfs(1);
    for (auto i:ans)
        out << i << ' ';
    return 0;
}