#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
#define int long long
struct UnionFind {
	vector<int> data;
	UnionFind(int size) : data(size, -1) { }
	bool unionSet(int x, int y) {
		
		x = root(x); y = root(y);
		if (x != y) {
			if (data[y] < data[x]) {
				swap(x, y);
			}
			else if ((data[y] == data[x]) && (y < x)) {
				swap(x, y);
			}
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool findSet(int x, int y) {
		return root(x) == root(y);
	}
	int root(int x) {
		return data[x] < 0 ? x : data[x] = root(data[x]);
	}
	int size(int x) {
		return -data[root(x)];
	}
};

signed main() {
	int N , M;
	cin >> N >> M;
	UnionFind uf(N);
	int a, b;
	for (int i = 0; i < M; i++) {
		cin >> a >> b;
		a--;
		b--;
		uf.unionSet(a, b);
	}
	for (int i = 0; i < N; i++) {
		cout << (uf.root(i) + 1) <<  endl;;
	}
	return 0;
}