#include <bits/stdc++.h>
using namespace std;
const int N = 100;
vector<int> v[N];
bool vis[N];

void bfs(int s){
    queue<int>q;
    vis[s]=1;
    q.push(s);
    while(!q.empty()){
        int x=q.front();
        cout<<x<<" ";
        q.pop();
        for(int i=0;i<v[x].size();i++){
            if(!vis[v[x][i]]){
                q.push(v[x][i]);
                vis[v[x][i]]=1;
            }
        }
    }
}

int main() {
	
	int V,E;
	cin>>V>>E;
	for(int i=0;i<E;i++){
	    int uu,vv;
	    cin>>uu>>vv;
	    v[uu].push_back(vv);
	    v[vv].push_back(uu);
	}
	bfs(0);
	
	return 0;
}