from heapq import heappush, heappop

INF = 10 ** 20

def dijkstra(s, N): # (始点, ノード数)
    dist = [-1 for _ in range(N)]
    hq = [(0, INF, s)]
    dist[s] = INF
    while hq:
        d, w, v = heappop(hq) # ノードを pop する
        for to, cost, width in G[v]: # ノード v に隣接しているノードに対して
            nw = min(w, width)
            nd = d+cost
            if nd>X:
                continue
            if dist[to] < nw :
                dist[to] = nw
                heappush(hq, (nd, nw, to))
    return dist

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

ans = dijkstra(0, N)
print(ans[-1])