import heapq

n,m,X=map(int,input().split())
edge=[list(map(int,input().split())) for _ in range(m)]

E=[[] for _ in range(n+1)]
for u,v,a,b in edge:
  E[u].append((v,a,b))
  E[v].append((u,a,b))
  
def f(y):
  D=[10**19]*(n+1)
  D[1]=0
  q=[]
  heapq.heappush(q,(0,1))
  while q:
    d,x=heapq.heappop(q)
    for e,a,b in E[x]:
      if y<=b and D[x]+a<D[e] and D[x]+a<=X:
        D[e]=D[x]+a
        heapq.heappush(q,(d+a,e))
        if e==n and D[e]<=X:return True

#  print(y,D)
  return 0<D[-1]<=X

l,r=0,10**9+1
while 1:
  m=(l+r)//2
  if m<=0:
    exit(print(-1))
  flag=f(m)

  if flag and 10**9<=m:
    exit(print(m))
  if flag and f(m+1)==0:
    exit(print(m))
    
  if flag:
    l=m+1
  else:
    r=m-1