import sys
input = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')


def dijkstra(s, g, N, G):
    # ゴールがない場合はg=-1とする。

    def cost(v, m):
        return v * N + m

    dist = [inf] * N
    mindist = [inf] * N
    seen = [False] * N
    Q = [cost(0, s)]
    while Q:
        c, m = divmod(heappop(Q), N)
        if seen[m]:
            continue
        seen[m] = True
        dist[m] = c
        if m == g:
            return dist

        #------heapをアップデートする。--------
        for u, C in G[m]:
            if seen[u]:
                continue
            newdist = dist[m] + C

            #------------------------------------
            if newdist >= mindist[u]:
                continue
            mindist[u] = newdist
            heappush(Q, cost(newdist, u))
    return dist


N, M, X = map(int, input().split())
Edge = []
for i in range(M):
    Edge.append(list(map(int, input().split())))


def check(m):
    G = [[] for i in range(N)]
    for u, v, a, b in Edge:
        if b < m:
            continue
        u, v = u - 1, v - 1
        G[u].append((v, a))
        G[v].append((u, a))
        
    D = dijkstra(0, N - 1, N, G)
    return D[-1] <= X
         

if not check(0):
    print(-1)
    exit()
    
yes = 0
no = 10 ** 18 + 5
while no - yes != 1:
    mid = (yes + no)//2
    if check(mid):
        yes = mid
    else:
        no = mid
        
print(yes)