#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll inf=1e9+7;

int num[10010];
map<int,int> m;
int main(){
	int N,M;
	cin>>N>>M;
	REP(i,0,N) {
		num[i]=1;
		m[i]=i;
	}
	REP(i,0,M){
		int a,b;
		cin>>a>>b;
		a--;b--;
		if(num[m[a]]>num[m[b]]||(num[m[a]]==num[m[b]]&&m[a]<m[b])){
			num[m[a]]+=num[m[b]];
			REP(i,0,N){
				if(m[i]==m[b]){
					m[i]=m[a];
				}
			}
		}else if(num[m[a]]<num[m[b]]||(num[m[a]]==num[m[b]]&&m[a]>m[b])) {
			num[m[b]]+=num[m[a]];
			REP(i,0,N){
				if(m[i]==m[a]){
					m[i]=m[b];
				}
			}
		}
		//cout<<a+1<<": "<<m[a]+1<<" "<<b+1<<": "<<m[b]+1<<endl;
	}
	REP(i,0,N){
		while(m[m[i]]!=m[i])
		m[i]=m[m[i]];
		p(m[i]+1);
	}
	return 0;
}