#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<tuple>
using namespace std;

typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,int> P;

struct edge{
    int from;
    int to;
    ll cost;
    ll width;
    edge(int from_,int to_,ll cost_,ll width_):from(from_),to(to_),cost(cost_),width(width_){};
};

int main(){
    int N,M;
    ll X;
    cin>>N>>M>>X;
    vector<vector<edge>> G(N);

    vector<edge> edges;

    
    for(int i=0;i<M;i++){
        int u,v,a,b;
        cin>>u>>v>>a>>b;
        u--;v--;

        G[u].emplace_back(u,v,a,b);
        G[v].emplace_back(v,u,a,b);
    }

    ll ub=INF,lb=0;//ubの大きさは必ず無理

    while(ub-lb>1){
        ll mid=(ub+lb)/2;

        vector<ll> dp(N,INF);
        priority_queue<P,vector<P>,greater<P>> pq;

        pq.emplace(0,0);//頂点0 コスト0

        while(!pq.empty()){
            auto [d,now]=pq.top();
            pq.pop();
            if(dp[now]<=d) continue;
            dp[now]=d;

            for(edge e:G[now]){
                if(e.width<mid) continue;

                if(dp[e.to]>dp[now]+e.cost){
                    pq.emplace(dp[now]+e.cost,e.to);
                }
            }
        }

        if(dp[N-1]<=X){
            lb=mid;
        }else{
            ub=mid;
        }
    }
    //cout<<"ub="<<ub<<endl;
    cout<<(lb==0?-1:lb)<<endl;

}