#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const int big=1e9+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int gcd(int a,int b){if(a%b==0){return b;}else return gcd(b,a%b);}

int main(void){
	int n,m,i,j,a,b;cin>>n>>m;
	vector<int>boss(n);//自分のうえ
	vector<int>num(n);
	for(i=0;i<n;i++){boss[i]=i;num[i]=1;}
	for(i=0;i<m;i++){
		cin>>a>>b;a--;b--;
		while(boss[a]!=a){a=boss[a];}
		while(boss[b]!=b){b=boss[b];}
		if(a==b){continue;}
		if(num[a]<num[b]){swap(a,b);}
		else if(num[a]==num[b]&&a>b){swap(a,b);}
		//aがかつ
		num[a]+=num[b];
		boss[b]=a;
	}
	for(i=0;i<n;i++){
		a=i;
		while(boss[a]!=a){a=boss[a];}
		cout<<a+1<<endl;
	}
	return 0;
}