#include<stdio.h>
const int LIMIT=10001;
int cs[LIMIT];
int uTree[LIMIT];

int f(int n){
	if(n==uTree[n]){
		return n;
	}else{
		int e=f(uTree[n]);
		uTree[n]=e;
		return e;
	}
}

int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++){
		cs[i]=1;
		uTree[i]=i;
	}
	for(int i=0;i<m;i++){
		int a,b;
		scanf("%d %d",&a,&b);
		a=f(a);
		b=f(b);
		if(a==b){
			continue;
		}else if(cs[a]!=cs[b]){
			if(cs[a]<cs[b]){
				uTree[a]=b;
				cs[b]+=cs[a];
			}else{
				uTree[b]=a;
				cs[a]+=cs[b];
			}
		}else{
			if(a>b){
				uTree[a]=b;
				cs[b]+=cs[a];
			}else{
				uTree[b]=a;
				cs[a]+=cs[b];
			}
		}
	}
	for(int i=1;i<=n;i++){
		printf("%d\n",f(i));
	}
}