using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, m) = (c[0], c[1]); var map = NArr(m); Array.Sort(map, (l, r) => r[2].CompareTo(l[2])); var uf = new UnionFindTree(n); var tree = new List[n]; for (var i = 0; i < tree.Length; ++i) tree[i] = new List(); var ans1 = 0; for (var i = 0; i < m; ++i) { if (map[i][2] < ans1) break; uf.Unite(map[i][0] - 1, map[i][1] - 1); if (uf.IsSameTree(0, n - 1)) { ans1 = map[i][2]; } tree[map[i][0] - 1].Add(map[i][1] - 1); tree[map[i][1] - 1].Add(map[i][0] - 1); } var len = Enumerable.Repeat(int.MaxValue / 2, n).ToArray(); len[0] = 0; var q = new Queue(); q.Enqueue(0); while (q.Count > 0) { var cur = q.Dequeue(); foreach (var next in tree[cur]) { if (len[next] <= len[cur] + 1) continue; len[next] = len[cur] + 1; q.Enqueue(next); } } WriteLine($"{ans1} {len[^1]}"); } class UnionFindTree { int[] roots; public UnionFindTree(int size) { roots = new int[size]; for (var i = 0; i < size; ++i) roots[i] = -1; } public int GetRoot(int a) { if (roots[a] < 0) return a; return roots[a] = GetRoot(roots[a]); } public bool IsSameTree(int a, int b) { return GetRoot(a) == GetRoot(b); } public bool Unite(int a, int b) { var x = GetRoot(a); var y = GetRoot(b); if (x == y) return false; if (-roots[x] < -roots[y]) { var tmp = x; x = y; y = tmp; } roots[x] += roots[y]; roots[y] = x; return true; } public int GetSize(int a) { return -roots[GetRoot(a)]; } } }