/*
  Copyright 2011 Marek "p2004a" Rusinowski
  Breadth-first search
*/
#include <cstdio>
#include <vector>
#include <queue>
 
#define MAXN 1000000
 
std::vector<int> edges[MAXN];
bool visited[MAXN];
 
void bfs(int v) {
  std::queue<int> q;
  q.push(v);
  visited[v] = true;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    printf("%d ", v + 1);
    for (unsigned i = 0; i < edges[v].size(); ++i) {
      if (!visited[edges[v][i]]) {
        visited[edges[v][i]] = true;
        q.push(edges[v][i]);
      }
    }
  }
}
 
int main() {
  int n, m, a, b;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; ++i) {
    scanf("%d %d", &a, &b);
    edges[--a].push_back(--b);
    edges[b].push_back(a);
  }
  bfs(0);
  printf("\n");
  return 0;
}
 

LyoKICBDb3B5cmlnaHQgMjAxMSBNYXJlayAicDIwMDRhIiBSdXNpbm93c2tpCiAgQnJlYWR0aC1maXJzdCBzZWFyY2gKKi8KI2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPHF1ZXVlPgoKI2RlZmluZSBNQVhOIDEwMDAwMDAKCnN0ZDo6dmVjdG9yPGludD4gZWRnZXNbTUFYTl07CmJvb2wgdmlzaXRlZFtNQVhOXTsKCnZvaWQgYmZzKGludCB2KSB7CiAgc3RkOjpxdWV1ZTxpbnQ+IHE7CiAgcS5wdXNoKHYpOwogIHZpc2l0ZWRbdl0gPSB0cnVlOwogIHdoaWxlICghcS5lbXB0eSgpKSB7CiAgICBpbnQgdiA9IHEuZnJvbnQoKTsKICAgIHEucG9wKCk7CiAgICBwcmludGYoIiVkICIsIHYgKyAxKTsKICAgIGZvciAodW5zaWduZWQgaSA9IDA7IGkgPCBlZGdlc1t2XS5zaXplKCk7ICsraSkgewogICAgICBpZiAoIXZpc2l0ZWRbZWRnZXNbdl1baV1dKSB7CiAgICAgICAgdmlzaXRlZFtlZGdlc1t2XVtpXV0gPSB0cnVlOwogICAgICAgIHEucHVzaChlZGdlc1t2XVtpXSk7CiAgICAgIH0KICAgIH0KICB9Cn0KCmludCBtYWluKCkgewogIGludCBuLCBtLCBhLCBiOwogIHNjYW5mKCIlZCAlZCIsICZuLCAmbSk7CiAgZm9yIChpbnQgaSA9IDA7IGkgPCBtOyArK2kpIHsKICAgIHNjYW5mKCIlZCAlZCIsICZhLCAmYik7CiAgICBlZGdlc1stLWFdLnB1c2hfYmFjaygtLWIpOwogICAgZWRnZXNbYl0ucHVzaF9iYWNrKGEpOwogIH0KICBiZnMoMCk7CiAgcHJpbnRmKCJcbiIpOwogIHJldHVybiAwOwp9Cg==

MyAyCjEgMgoxIDM=

3 2
1 2
1 3