// yukicoder: No.556 仁義なきサルたち
// 2019.7.26 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(int n) { // 非負整数の表示（出力）
	int i;
	char b[20];

	if (!n) pc('0');
	else {
		//		if (n < 0) pc('-'), n = -n;
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
	pc('\n');
}

/* UNION-FIND library */
#define MAX 10003
int id[MAX], size[MAX];
void init(int n) { int i; for (i = 0; i < n; i++) id[i] = i, size[i] = 1; }
int root(int i) { while (i != id[i]) id[i] = id[id[i]], i = id[i]; return i; }
int connected(int p, int q) { return root(p) == root(q); }
void unite(int p, int q) {
    int i = root(p), j = root(q); if (i == j) return;
    if (size[i] < size[j]) id[i] = j, size[j] += size[i]; else id[j] = i, size[i] += size[j];
}

int top[MAX], sz[MAX];

int main()
{
	int i, N, M, a, b, aa, bb;

	N = in(), M = in();
	init(N+1); for (i = 1; i <= N; i++) top[i] = i, sz[i] = 1;
	while (M--) {
		a = in(), b = in();
		aa = top[root(a)], bb = top[root(b)];
		if (aa == bb) continue;
		unite(a, b);
		if (sz[aa] == sz[bb]) {
			if (aa < bb) top[root(a)] = top[root(b)] = aa, sz[aa] <<= 1;
			else         top[root(a)] = top[root(b)] = bb, sz[bb] <<= 1;
		} else if (sz[aa] > sz[bb]) {
			top[root(a)] = top[root(b)] = aa, sz[aa] += sz[bb];
		} else {
			top[root(a)] = top[root(b)] = bb, sz[bb] += sz[aa];
		}
	}
	for (i = 1; i <= N; i++) out(top[root(i)]);
	return 0;
}