import heapq

n,m,X=map(int,input().split())
edge=[tuple(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))
  
for i in range(n+1):
  E[i].sort(key=lambda x:x[2],reverse=True)

def f(w):
  D=[10**19]*(n+1)
  D[1]=0
  q=[(0,1)]
  while q:
    d,x=heapq.heappop(q)
    if x==n:break
    if D[x]<d:continue
    for e,a,b in E[x]:
      if b<w:break
      if D[x]+a<D[e]:
        D[e]=D[x]+a
        heapq.heappush(q,(d+a,e))

  return 0<D[-1]<=X

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

  if flag:
    l=m
  else:
    r=m
    
print(l)