#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int Mod = 1e9 + 7;
const int N = 1e5 + 100;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
inline long long dpow(long long a, long long b) {
  long long r = 1, t = a;
  while (b) {
    if (b & 1) r = (r * t) % Mod;
    b >>= 1;
    t = (t * t) % Mod;
  }
  return r;
}
inline long long fpow(long long a, long long b) {
  long long r = 1, t = a;
  while (b) {
    if (b & 1) r = (r * t);
    b >>= 1;
    t = (t * t);
  }
  return r;
}
vector<int> G[N];
int n, m, cnt;
bool vis[N];
void BFS() {
  priority_queue<int, vector<int>, greater<int>> q;
  q.push(1), vis[1] = true;
  while (!q.empty()) {
    int u = q.top();
    q.pop();
    printf("%d ", u);
    for (auto v : G[u]) {
      if (!vis[v]) {
        q.push(v);
        vis[v] = true;
      }
    }
  }
  puts("");
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) sort((G[i]).begin(), (G[i]).end());
  BFS();
  return 0;
}
