#include <bits/stdc++.h>

using namespace std;
vector <int> muchii[50001];
queue <int> q;
bitset <50001> viz;
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n,m;
    cin >> n >> m;
    for(int i = 1;i <= m;i++){
        int x,y;
        cin >> x >> y;
        muchii[x].push_back(y);
    }
    q.push(1);
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(auto x : muchii[nod]){
            if(!viz[x])
                q.push(x);
        }
        cout << nod << " ";
    }
    return 0;
}