from collections import defaultdict
from heapq import heappush, heappop

INF = 1 << 60
N, M, X = map(int, input().split())
adj = defaultdict(list)
for _ in range(M):
    u, v, a, b = map(int, input().split())
    u -= 1
    v -= 1
    adj[u].append((v, a, b))
    adj[v].append((u, a, b))


# 大きさ m を輸送できるか
def can(m: int) -> bool:
    q = [(0, 0)]
    used = [INF] * N
    while q:
        tm, v = heappop(q)
        if v == N-1: return True
        if used[v] <= tm: continue
        used[v] = tm

        for to, a, b in adj[v]:
            if b < m: continue
            if tm + a > X: continue
            heappush(q, (tm + a, to))

    return False


ans = -1
lo = 1
hi = INF
while lo <= hi:
    m = (lo + hi) // 2
    if can(m):
        ans = max(ans, m)
        lo = m + 1
    else:
        hi = m - 1

print(ans)