N,M,X = map(int,input().split())
UVAB = [list(map(int,input().split())) for _ in range(M)]
E = [[] for _ in range(N)]
maxa = 0
for u,v,a,b in UVAB:
    u -= 1
    v -= 1
    E[u].append((v,a,b))
    E[v].append((u,a,b))
    maxa = max(maxa,b)
INF = 10 ** 18

from heapq import *
#普通のダイクストラ
def dijkstra(x):
    D = [INF] * N
    D[0] = 0
    q = [(0,0)]
    while len(q) > 0:
        d, u = heappop(q)
        #下のifでTLE解消することがある
        if d > D[u]: continue
        for vab in E[u]:
            v,a,b = vab
            if b < x:
                continue
            if D[v] > D[u] + a:
                D[v] = D[u] + a
                heappush(q, (D[v], v))
    return D[N-1]

lb = -1
ub = maxa + 1
while ub - lb > 1:
    mid = (lb + ub)//2
    if dijkstra(mid) <= X:
        lb = mid
    else:
        ub = mid

print(lb)