#include <iostream>
#include <algorithm>
using namespace std;
int N, M, a, b, par[10009];
int sz(int x) {
	int ret = 0;
	for (int i = 0; i < N; i++) {
		if (par[i] == par[x]) ret++;
	}
	return ret;
}
int main() {
	cin >> N >> M;
	for (int i = 0; i < N; i++) par[i] = i;
	for (int i = 0; i < M; i++) {
		cin >> a >> b; a--, b--;
		int sa = sz(a), sb = sz(b);
		if (sa < sb) swap(a, b);
		else if (sa == sb && par[a] > par[b]) swap(a, b);
		int pb = par[b];
		for (int j = 0; j < N; j++) {
			if (par[j] == pb) par[j] = par[a];
		}
	}
	for (int i = 0; i < N; i++) {
		cout << par[i] + 1 << endl;
	}
	return 0;
}