#include<bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,M;
  ll X;
  cin>>N>>M>>X;
  vector<vector<array<ll,3>>>G(N);
  for(int i=0;i<M;i++){
    ll u,v;
    ll A,B;
    cin>>u>>v>>A>>B;
    --u,--v;
    G[u].push_back({v,A,B});
    G[v].push_back({u,A,B});
  }
  ll ans=-1,ng=1e9+1;
  while(ng-ans>1){
    int yokan=(ans+ng)/2;
    vector<ll>dist(N,X+1);
    dist[0]=0;
    priority_queue<array<ll,2>,vector<array<ll,2>>,greater<array<ll,2>>>pq;
    pq.push({0,0});
    while(pq.size()){
      ll d=pq.top()[0],v=pq.top()[1];
      pq.pop();
      if(dist[v]<d)continue;
      for(auto i:G[v]){
        if(i[2]>=yokan&&dist[i[0]]>d+i[1]){
          dist[i[0]]=d+i[1];
          pq.push({dist[i[0]],i[0]});
        }
      }
    }
    if(dist[N-1]<=X){
      ans=yokan;
    }else{
      ng=yokan;
    }
  }
  cout<<ans<<'\n';
}