from collections import deque

n, m, k = map(int, input().split())
edges = [[] for _ in range(n)]
for _ in range(m):
    u, v, c = map(int, input().split())
    u -= 1
    v -= 1
    edges[u].append((v, c))
    
queue = deque()
queue.append((0, 0))
used = [False] * n
used[0] = True
while queue:
    pos, d = queue.popleft()
    if pos == n - 1:
        break
    for npos, _ in edges[pos]:
        if used[npos]:
            continue
        used[npos] = True
        queue.append((npos, d + 1))
        
if d < k:
    print(0)
    exit()
    
def ok(x):
    dist = [10 ** 20] * n
    queue = deque()
    queue.append((0, 0))
    dist[0] = 0
    while queue:
        pos, d = queue.popleft()
        if dist[pos] != d:
            continue
        for npos, c in edges[pos]:
            if c >= x:
                if dist[npos] > d + 1:
                    dist[npos] = d + 1
                    queue.append((npos, d + 1))
            else:
                if dist[npos] > d:
                    dist[npos] = d
                    queue.appendleft((npos, d))
    return dist[npos] < k
l = 0
r = 200200
while r - l > 1:
    mid = (r + l) // 2
    if ok(mid):
        r = mid
    else:
        l = mid
print(l)