#include <iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <string>
#define MAX 10001
using namespace std;
typedef long long int lli;

int f[MAX];
int k[MAX];


int find(int x) {
	if (f[x] == x)return x;
	else return f[x] = find(f[x]);
}

int u(int a, int b) {
	int fa = find(a);
	int fb = find(b);
	if (fa == fb)return 0;
	// cout<<"u:"<<a<<":"<<find(a)<<" "<<b<<":"<<find(b)<<endl;
	f[fa] = fb;
	int t = k[fa] + k[fb];
	fa = find(a);
	k[fa] = k[fb] = t;
}

int main(void) {
	int n, m, a, b;
	cin >> n >> m;
	for (int i = 0; i<n; i++) {
		f[i] = i;
		k[i] = 1;
	}
	while (m--) {
		cin >> a >> b;
		a--; b--;
		if (k[find(a)] == k[find(b)]) {
			if (find(a)>find(b)) u(a, b);
			else if (find(a)<find(b)) u(b, a);
		}
		else if (k[find(a)]<k[find(b)]) u(a, b);
		else u(b, a);
	}
	for (int i = 0; i<n; i++) {
		cout << find(i) + 1 << endl;
	}
	return 0;
}