#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<long long ,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 2e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 


//-----def end-----//

struct Edges {
    int v; 
    long long a , b;
    Edges (int v , long long a , long long b):
        v(v) , a(a) , b(b) {}
};

int main () {
    int n , m;
    long long x;
    cin >> n >> m >> x;
    vector<vector<Edges>> g(n);
    rep(i , m) {
        int u , v;
        long long a , b;
        cin >> u >> v >> a >> b;
        u--; v--;
        g[u].emplace_back(v , a , b);
        g[v].emplace_back(u , a , b);
    }
    auto dijkstra = [&] (int s , int t , long long wid) -> long long {
        vector<long long> dist(n , LINF);
        dist[s] = 0;
        priority_queue<P,vector<P>,greater<P>> qe;
        qe.emplace(0 , s);
        while(!qe.empty()) {
            auto [n_cost , now] = qe.top();
            qe.pop();
            if(dist[now] < n_cost) continue;
            for(auto [to , a , b] : g[now]) {
                if(b < wid) continue;
                if(chmin(dist[to] , n_cost+a)) {
                    qe.emplace(n_cost+a , to);
                }
            }
        }
        return dist[t];
    };
    if(x < dijkstra(0 , n-1 , 1)) {
        cout << -1 << endl;
        return 0;
    }
    long long l = 1 , r = LINF;
    while(r-l>1) {
        long long mid = (l+r)/2;
        if(dijkstra(0,n-1,mid) <= x) l = mid;
        else r = mid;
    }
    cout << l << endl;
	return 0;
}