import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 /** * 単調増加 * (l, h] 方式 * @return マッチするものがなかったらmx */ inline fun findMin(mn: Int, mx: Int, f: (Int) -> Boolean): Int { var low = mn - 1 var high = mx while(high - low > 1) { val m = (low + high) / 2 if (f(m)) high = m else low = m } return high } data class Edge(val v: Int, val u: Int, val c: Int, var weight: Int) class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) private val N = ni() private val M = ni() private val K = ni() private val D = IntArray(N) private val g = Array(N){ mutableListOf()} val inf = 1e9.toInt() + 100 fun dijk(g: Array>, s: Int): IntArray { D.fill(inf) D[s] = 0 val que = ArrayDeque() que.add(s) while(que.isNotEmpty()) { val v = que.poll()!! for (i in 0 until g[v].size) { val e = g[v][i] if (D[v] + e.weight < D[e.u]) { D[e.u] = D[v] + e.weight if (e.weight == 0) que.addFirst(e.u) else que.addLast(e.u) } } } return D } fun solve() { for (i in 0 until M) { val (v, u) = na(2, -1) val c = ni() g[v].add(Edge(v, u, c, -1)) g[u].add(Edge(u, v, c, -1)) } fun calc(x: Int): IntArray { for (i in 0 until N) { for (j in g[i].indices) { val e = g[i][j] e.weight = if (e.c > x) 1 else 0 } } return dijk(g, 0) } // K進むことなくNに到達できる if (calc(0)[N - 1] < K) { out.println(0) return } val ans = findMin(1, 200_000) { x -> val D = calc(x) D[N - 1] <= K - 1 } out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return IntArray(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } /** * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと */ private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())} } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }