using static System.Math; using System; public class UnionFind { private int[] data; public UnionFind(int size) { data = new int[size]; for (int i = 0; i < size; i++) data[i] = -1; } public bool Unite(int x, int y) { x = Root(x); y = Root(y); if (x != y) { if (data[y] < data[x]) { var tmp = y; y = x; x = tmp; } data[x] += data[y]; data[y] = x; } return x != y; } public bool IsSameGroup(int x, int y) => Root(x) == Root(y); public int Root(int x) => data[x] < 0 ? x : data[x] = Root(data[x]); public int getMem(int x) => -data[Root(x)]; } public class Hello { static void Main() { string[] line = Console.ReadLine().Trim().Split(' '); var n = int.Parse(line[0]); var m = int.Parse(line[1]); getAns(n, m); } static void getAns(int n, int m) { var uf = new UnionFind(n + 1); var p = new int[n]; for (int i = 0; i < n; i++) p[i] = i + 1; for (int i = 0; i < m; i++) { string[] line = Console.ReadLine().Trim().Split(' '); var a = int.Parse(line[0]); var b = int.Parse(line[1]); if (uf.IsSameGroup(a, b)) continue; var counta = uf.getMem(a); var countb = uf.getMem(b); if (counta == countb) { var ap = p[uf.Root(a)-1]; var bp = p[uf.Root(b) -1]; var tp = Min(ap, bp); p[uf.Root(a)-1 ] = tp; p[uf.Root(b) -1] = tp; } else { if (counta > countb) p[uf.Root(b) -1] = p[uf.Root(a)-1]; else p[uf.Root(a) -1] = p[uf.Root(b)-1]; } uf.Unite(a, b); } var ans = new int[n]; for (int i = 1; i <= n; i++) ans[i - 1] = p[uf.Root(i) - 1]; Console.WriteLine(string.Join("\n",ans)); } }