#include #include #include #include #include #include #include #include #include #define MAX_N 100001 #define INF_INT 2147483647 #define INF_LL 9223372036854775807 #define REP(i,n) for(int i=0;i<(int)(n);i++) void init(int n); int find(int n); void unite(int x,int y); bool same(int x, int y); int dx[4] = {1,0,0,-1}; int dy[4] = {0,1,-1,0}; using namespace std; typedef long long int ll; typedef pair P; bool cmp_P(const P &a,const P &b){ return a.second < b.second; } int par[MAX_N]; int ranks[MAX_N]; int ninzu[MAX_N]; int main() { int N,M,a,b; REP(i,MAX_N) ninzu[i] = 1; cin >> N >> M; init(N); REP(i,M){ cin >> a >> b; unite(--a,--b); } REP(i,N){ cout << (find(i)+1) << endl; } return 0; } //n要素で初期化 void init(int n){ REP(i,n){ par[i] = i; ranks[i] = 0; } } //木の根を求める int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } } void unite(int x,int y){ x = find(x); y = find(y); if(x == y) return; if(ninzu[x] < ninzu[y]){ par[x] = y; ninzu[y] += ninzu[x]; }else{ if(ninzu[x] == ninzu[y]){ if(x > y){ par[x] = y; ninzu[y] += ninzu[x]; }else{ par[y] = x; ninzu[x] += ninzu[y]; } }else{ par[y] = x; ninzu[x] += ninzu[y]; } } } bool same(int x, int y){ return find(x) == find(y); }