#include <bits/stdc++.h>
#define Nmax 50005
using namespace std;

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

vector < int > v[Nmax];

queue <int> q;

bitset < Nmax >b;

void BFS ( int x )
{

    fout << x << '\n' ;

    b[x] = 1;

    int lng = v[x].size();

    for ( int i = 0; i < lng; i++ )
        b[v[x][i]] = 1, q.push(v[x][i]);

    while ( ! q.empty() )
    {
        x = q.front () ;
        q.pop();

        fout << x << '\n';

        lng = v[x].size();

        for ( int i = 0 ; i < lng; i++ )
          if( b[v[x][i]] == 0 )  q.push(v[x][i]), b[v[x][i]] = 1;

    }

}

int main()
{
    int n, m,x ,y ;

    fin >> n >> m;

    for ( int i = 1; i <= m; i++ )
    {
        fin >> x >> y;

        v[x].push_back(y);
        v[y].push_back(x);
    }

    BFS( 1 );
}