#include <bits/stdc++.h>
#define N 50000
using namespace std;

array <vector <int>, N> G;
bitset <N> viz;
void dfs (int x) {
    viz[x]=1;
    cout << x << ' ';
    for (auto it: G[x])
        if (!viz[it])
            dfs(it);
}

int main () {
    freopen ("sortaret.in", "r", stdin);
    freopen ("sortaret.out", "w", stdout);
    int n, m, start, i, j;
    cin >> n >> m;
    cin >> start >> j;
    G[start].push_back(j);
    for (--m; m; m--) {
        cin >> i >> j;
        G[i].push_back(j);
    }
    dfs(start);
    return 0;
}