from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
sys.setrecursionlimit(3*10**5)
input = sys.stdin.readline
INF = (1<<60)
N,M,X = map(int,input().split())
e = [[] for _ in range(N)]
for _ in range(M):
    u,v,a,b = map(int,input().split())
    u -= 1
    v -= 1
    e[u].append((v,a,b))
    e[v].append((u,a,b))
    
def dijkstra(s,e,t):
    
    N = len(e)
    dist = [INF]*N
    dist[s]=0
    h = []
    heappush(h,(0,s))
    while h:
        nw,v = heappop(h)
        if dist[v]!=nw:
            continue
        for iv,ic,iw in e[v]:
            if iw<t:
                continue
            nc = ic + nw
            if nc < dist[iv]:
                dist[iv] = nc
                heappush(h,(nc,iv))
    return dist


def is_ok(T):
    D = dijkstra(0,e,T)
    return D[-1]<=X

if not is_ok(1):
    print(-1)
    exit()
y = 10**9 + 100
x = 1
while y-x>1:
    mid = (y+x)//2
    if is_ok(mid):
        x = mid
    else:
        y = mid
print(x)