import heapq
def daiku(s,num):
    hq=[]
    heapq.heappush(hq,[0,s])
    high=[10**14+1 for _ in range(N)]
    use=[False for _ in range(N)]
    while len(hq)!=0:
        h,p=heapq.heappop(hq)
        if not use[p]:
            use[p]=True
            for e,c,m in edge[p]:
                if m>=num and high[e]>h+c:
                    high[e]=h+c
                    heapq.heappush(hq,[h+c,e])
    return high[-1]

def nibun():
    left,right=-1,len(use)
    while right-left>1:
        mid=(right+left)//2
        dist=daiku(0,use[mid])
        if dist!=-1 and dist<=X:
            left=mid
        else:
            right=mid
    if left==-1:
        return left
    return use[left]

import sys
input=sys.stdin.readline
N,M,X=map(int,input().split())
edge=[[] for _ in range(N)]
use=set()
for _ in range(M):
    u,v,a,b=map(int,input().split())
    use.add(b)
    edge[u-1].append([v-1,a,b])
    edge[v-1].append([u-1,a,b])
use=list(use)
use.sort()
print(nibun())