#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>  
using namespace std;
#define eps 0.00000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
int union_num[20000] = {};
int union_sum[20000] = {};
pair<int,int> union_number(int now) {
	if (union_num[now] == now) return make_pair(union_sum[now],now);
	pair<int, int> gettin = union_number(union_num[now]);
	union_num[now] = gettin.second;
	return make_pair(gettin.first,gettin.second);
}
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1;i <= n;++i) {
		union_num[i] = i;
		union_sum[i] = 1;
	}
	REP(i, m) {
		int a, b;
		cin >> a >> b;
		pair<int, int> c = union_number(a),d = union_number(b);
		if (c.first > d.first) {
			//c win
			union_num[d.second] = c.second;
			union_sum[c.second] = c.first + d.first;
		}
		else if (c.first < d.first) {
			union_num[c.second] = d.second;
			union_sum[d.second] = c.first + d.first;
		}else if(c.first == d.first){
			if (c.second < d.second) {
				union_num[d.second] = c.second;
				union_sum[c.second] = c.first + d.first;
			}
			else if(c.second != d.second){
				union_num[c.second] = d.second;
				union_sum[d.second] = c.first + d.first;
			}
		}
	}
	for (int i = 1;i <= n;++i) {
		cout << union_number(i).second << endl;
	}
	return 0;
}