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

int main() {
  int n,m;
  long long x;
  cin>>n>>m>>x;
  vector<vector<tuple<int,long long,long long>>> g(n);
  for (int i=0;i<m;i++) {
    int u,v;
    long long a,b;
    cin>>u>>v>>a>>b;
    u--;
    v--;
    g[u].push_back({v,a,b});
    g[v].push_back({u,a,b});
  }
  long long l=-1,r=1e10;
  while (r-l>1) {
    long long mid=(l+r)/2;
    vector<long long> dst(n,LLONG_MAX);
    dst[0]=0;
    priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>>pq;
    pq.push({0,0});
    while (pq.size()) {
      auto [tmp,now]=pq.top();
      pq.pop();
      if (tmp>dst[now]) {
        continue;
      }
      for (auto [nxt,ngs,hb]:g[now]) {
        if (hb<mid) {
          continue;
        }
        if (dst[now]+ngs>dst[nxt]) {
          continue;
        }
        dst[nxt]=dst[now]+ngs;
        pq.push({dst[nxt],nxt});
      }
    }
    if (dst.back()<=x) {
      l=mid;
    }
    else {
      r=mid;
    }
  }
  cout<<(l<=0?-1:l)<<endl;
}