from heapq import heappush, heappop

N, M, X = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
    u, v, a, b = map(int, input().split())
    G[u-1].append((v-1, a, b))
    G[v-1].append((u-1, a, b))

INF = 10**18

def dijkstra(start, limit):
    dist = [INF]*N
    dist[start] = 0
    visited = [False]*N
    que = [(0, start)]
    while que:
        d, now = heappop(que)
        if visited[now]:
            continue
        visited[now] = True
        for next, weight, b in G[now]:
            if b < limit:
                continue
            if dist[now]+weight < dist[next]:
                dist[next] = dist[now]+weight
                heappush(que, (dist[next], next))
    return dist

left = 0
right = 10**9+1
while left+1 < right:
    mid = (left+right)//2
    if dijkstra(0, mid)[-1] <= X:
        left = mid
    else:
        right = mid

print(left if left != 0 else -1)