#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.0000000001;

long long int N, M, K, Q, W, H, L, R;
long long int ans;

class UnionFind {
	vector<int>parent;
	vector<int>rank;
public:
	UnionFind(int num) {
		num++;
		parent.resize(num);
		rank.resize(num);
		for (int i = 0; i < num; i++) {
			parent[i] = i;
			rank[i] = 1;
		}
	}
	int Find(int node) {
		if (parent[node] == node)return node;
		else return parent[node] = Find(parent[node]);
	}
	void Unite(int u, int v) {
		u = Find(u);
		v = Find(v);
		if (u == v)return;
		if (rank[u] < rank[v]) {
			parent[u] = v;
			rank[v] += rank[u];
		}
		else if (rank[u] > rank[v]) {
			parent[v] = u;
			rank[u] += rank[v];
		}
		else {
			if (u < v) {
				parent[v] = u;
				rank[u] += rank[v];
			}
			else {
				parent[u] = v;
				rank[v] += rank[u];
			}
		}
	}
	bool Check_Same(int u, int v) {
		return Find(u) == Find(v);
	}
};

int main() {
	ios::sync_with_stdio(false);
	UnionFind uf(20000);
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		cin >> L >> R;
		uf.Unite(L, R);
	}
	for (int i = 1; i <= N; i++)cout << uf.Find(i) << endl;
	return 0;
}