#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
queue<int>q;
vector<int>L[50005];
bool viz[50005];
void Citire()
{
    int x,y;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
        fin>>x>>y,
        L[x].push_back(y),
        L[y].push_back(x);
}
int main()
{
    Citire();
    int el;
    q.push(1);
    viz[1]=1;
    while(!q.empty())
    {
        el=q.front();
        q.pop();
        fout<<el<<" ";
        for(int i=0;i<L[el].size();i++)
            if(!viz[L[el][i]])
                q.push(L[el][i]),
                viz[L[el][i]]=1;
    }

    return 0;
}