from heapq import heappop,heappush
n,m,x = map(int,input().split())
size = set()
size.add(1)

e = [[] for i in range(n)]
for _ in range(m):
    u,v,a,b = map(int,input().split())
    size.add(b)
    u,v = u-1,v-1
    e[u].append([v,a,b])
    e[v].append([u,a,b])


size = sorted(size)

l = 0
r = len(size)

inf = 10**20
mod = 1<<20
def search(s):
    dis = [inf]*n
    dis[0] = 0
    h = [0]
    while h:
        d,now = divmod(heappop(h),mod)

        if dis[now] != d:
            continue

        for nex,a,b in e[now]:
            if b < s:
                continue
            if dis[nex] > dis[now]+a:
                dis[nex] = dis[now]+a
                heappush(h,(dis[nex]<<20)+nex)
    return dis[-1]

while r > l+1:
    m = (r+l)//2
    if search(size[m]) <= x:
        l = m
    else:
        r = m


ans = search(size[l])
if ans > x:
    print(-1)
else:
    print(size[l])