#include "bits/stdc++.h" using namespace std; #define int long long #define FOR(i, a, b) for(int i=(a);i<(b);i++) #define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--) #define REP(i, n) for(int i=0; i<(n); i++) #define RREP(i, n) for(int i=(n-1); i>=0; i--) #define ALL(a) (a).begin(),(a).end() #define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end()); #define CONTAIN(a, b) find(ALL(a), (b)) != (a).end() #define array2(type, x, y) array, x> #define vector2(type) vector > #define out(...) printf(__VA_ARGS__) int dxy[] = {0, 1, 0, -1, 0}; /*================================*/ int N, M; struct Monkey { int parent; int count; }; Monkey *monkeys[15000]; int boss(int i) { if (monkeys[i]->parent == i) { return i; } return monkeys[i]->parent = boss(monkeys[i]->parent); } void merge(int a, int b) { auto ma = monkeys[a]; auto mb = monkeys[b]; mb->parent = ma->parent; ma->count += mb->count; } signed main() { #if DEBUG std::ifstream in("input.txt"); std::cin.rdbuf(in.rdbuf()); #endif cin >> N >> M; REP(i, N) { monkeys[i] = new Monkey(); monkeys[i]->parent = i; monkeys[i]->count = 1; } int a, b; REP(i, M) { cin >> a >> b; int ba = boss(--a); int bb = boss(--b); if (ba == bb) continue; auto ma = monkeys[ba]; auto mb = monkeys[bb]; if (ma->count > mb->count) merge(boss(a), boss(b)); else if (mb->count > ma->count) merge(boss(b), boss(a)); else if (ba < bb) merge(boss(a), boss(b)); else if (bb < ba) merge(boss(b), boss(a)); } REP(i, N) { cout << boss(i) + 1 << endl; } return 0; }