#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int const maxim = 50005;
vector<int> stocare[maxim];
bool vizitat[maxim];
int n;
queue<int> coada;

void dfs(int nod){
out << nod << " ";
for(size_t i = 0; i<stocare[nod].size();i++){
    int vecin = stocare[nod][i];
    if(vizitat[vecin]==false){
        vizitat[vecin]=true;
        dfs(vecin);
    }
}

}



int main(){
int m;
in >> n >> m;
for(int i=1;i<=m;i++){
    int a,b;
    in >> a >> b;
    stocare[a].push_back(b);
    stocare[b].push_back(a);
}
vizitat[1] = true;
dfs(1);
return 0;}