#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, 1, 0, -1, 1, -1, 1, -1 };
const long long mod = 998244353;
const ll inf = 1LL << 60;
const int INF = 1e9 + 1;

int main()
{
    int n, m;
    ll x;
    cin >> n >> m >> x;
    vector<vector<tuple<int, int, int>>> g(n);
    for (int i = 0; i < m; i++) {
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        u--;
        v--;
        g[u].emplace_back(v, a, b);
        g[v].emplace_back(u, a, b);
    }

    auto check = [&](int k) {
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
        vector<ll> d(n, inf);
        q.emplace(0, 0);
        while (q.size()) {
            auto [dist, u] = q.top();
            q.pop();
            if (dist >= d[u])
                continue;
            d[u] = dist;
            for (auto [v, a, b] : g[u]) {
                if (b < k)
                    continue;
                if (dist + a >= d[v])
                    continue;
                q.emplace(dist + a, v);
            }
        }
        return d[n - 1] <= x;
    };

    int l = 0, r = INF;
    while (r - l > 1) {
        int mid = (r + l) / 2;
        if (check(mid))
            l = mid;
        else
            r = mid;
    }
    if (l == 0)
        cout << -1 << endl;
    else
        cout << l << endl;
}