import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
from heapq import *
INF = 10**18
def dijkstra(g, s, n, x):
    dist = [INF]*n
    hq = [(0, s)]
    dist[s] = 0
    while hq:
        d, v = heappop(hq)
        if dist[v]!=d:
            continue
        for to, a,b, in g[v]:
            if b >= x and dist[v] + a < dist[to]:
                dist[to] = dist[v] + a
                heappush(hq, (dist[to], to))
    return dist
n,m,x = na()

g = [[] for i in range(n)]

for _ in range(m):
    u,v,a,b = na()
    u-=1
    v-=1
    g[u].append((v,a,b))
    g[v].append((u,a,b))

ok = -1
ng = 10**9
while abs(ok-ng)>1:
    d = ok+ng>>1
    dist = dijkstra(g,0,n,d)
    #print(d,dist)
    if dist[-1] <= x:
        ok = d
    else:
        ng = d


print(ok)