#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005;
const ll INF=1LL<<60;

vector<pair<int,pair<int,int>>> G[MAX];
ll dis[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,M,X;cin>>N>>M>>X;
    for(int i=0;i<M;i++){
        int a,b,c,d;cin>>a>>b>>c>>d;a--;b--;
        G[a].push_back(mp(b,mp(c,d)));
        G[b].push_back(mp(a,mp(c,d)));
    }
    ll left=0,right=2e9;
    while(right-left>1){
        ll mid=(left+right)/2;
        for(int i=0;i<N;i++) dis[i]=INF;
        dis[0]=0;
        
        priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> PQ;
        PQ.push(mp(0,0));
        
        while(!PQ.empty()){
            auto [d,u]=PQ.top();PQ.pop();
            if(dis[u]<d) continue;
            for(auto to:G[u]){
                auto t=to.fi;
                auto [a,b]=to.se;
                if(b<mid) continue;
                if(chmin(dis[t],dis[u]+a)) PQ.push(mp(dis[t],t));
            }
        }
        
        if(dis[N-1]<=X) left=mid;
        else right=mid;
    }
    
    if(left==0) left=-1;
    cout<<left<<endl;
}