#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> l[201];
queue <int> coada;
int n,viz[201];

void citire()
{
    int i,x,y,m;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        l[x].push_back(y);
        l[y].push_back(x);
    }
}

void bfs(int nod_start)
{
    int i,k,j;
    for(i=1;i<=n;i++)
    {
        viz[i]=0;
    }
    coada.push(nod_start);
    viz[nod_start]=1;

    while(!coada.empty())
    {
        k=coada.front();
        fout<<k<<" ";
        coada.pop();
        for(i=0;i<l[k].size();i++)
        {
            j=l[k][i];
            if(viz[j]==0)
            {
                coada.push(j);
                viz[j]=1;
            }
        }
    }
}

int main()
{
    citire();
    bfs(1);
    return 0;
}