#include "Matrix.h"
const int N = 105;
int x[N];
int pre[N];
void init(int n)
{
for (int i = 0; i < n+1; i++)
pre[i] = i;
}
int findf(int x)
{
if (pre[x] == x) return x;
return pre[x] = findf(pre[x]);
}
void uunion(int i,int j)
{
int p1 = findf(i);
int p2 = findf(j);
if (p1 < p2) pre[p2] = p1;
else pre[p1] = p2;
}
int main()
{
int n,m;
cin >> n>>m;
init(n);
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
uunion(a, b);
}
for (int i = 1; i < n + 1; i++)
if (pre[i] == i) cout << i << ' ';
cout <<endl;
system("pause");
return 0;
}
/*
14 11
1 11
7 11
2 12
12 8
11 12
3 13
4 13
13 14
14 9
5 14
6 10
*/