#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}


ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}



using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
using vvvvm = vector<vvvm>;
using vvvvvm = vector<vvvvm>;
using vvvvvvm = vector<vvvvvm>;

vector<mint> fact, factinv, inv;
const ll mod = 1e9 + 7;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}

struct E {
    ll to, t, L;
};

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N, M, X;
    cin >> N >> M >> X;
    vector<vector<E>> G(N);
    ll ma = 0;
    rep(i, M) {
        ll A, B, C, D;
        cin >> A >> B >> C >> D;
        A--; B--;
        G[A].push_back(E({ B,C,D }));
        G[B].push_back(E({ A,C,D }));
        chmax(ma, D);
    }
    ll D = 0, U = ma + 10;
    while (U - D > 1) {
        ll mid = (U + D) / 2;
        vll dist(N, 1e18 + 10);
        dist[0] = 0;
        vb seen(N, false);
        priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;
        Q.push({ 0,0 });
        while (!Q.empty()) {
            auto nc = Q.top();
            Q.pop();
            ll n = nc.second;
            ll c = nc.first;
            if (seen[n])continue;
            seen[n] = 1;
            for (auto v : G[n]) {
                if (seen[v.to])continue;
                if (v.L < mid)continue;
                if (dist[v.to] <= c + v.t)continue;
                dist[v.to] = c + v.t;
                Q.push({ c + v.t,v.to });
            }
        }
        (dist[N - 1] <= X ? D : U) = mid;
    }
    cout << (D > 0 ? D : -1) << endl;

}