#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
int n, m;
int edge[1010][1010];
int flag[1010];
void dfs(int p)
{
if (flag[p])
return ;
flag[p] = 1;
for (int i = 1; i <= n; ++i)
if (edge[p][i])
dfs(i);
}
int main()
{
memset(edge, 0, sizeof(edge));
memset(flag, 0, sizeof(flag));
cin >> n >> m;
for (int i = 1; i <= m; ++i)
{
int a, b;
cin >> a >> b;
edge[a][b] = edge[b][a] = 1;
}
dfs(1);
for (int i = 1; i <= n; ++i)
if (flag[i])
cout << i << " ";
return 0;
}