#include <bits/stdc++.h>
using namespace std;
void fast_io() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
}

int main() {
    fast_io();
    int n, m;
    long long x;
    cin >> n >> m >> x;
    vector<vector<tuple<int, int, long long>>> g(n);
    for (int i = 0; i < m; i++) {
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        u--;
        v--;
        g[u].push_back({v, a, b});
        g[v].push_back({u, a, b});
    }
    long long ok = -1, ng = 1e10;
    using pli = pair<long long, int>;
    while (ok + 1 < ng) {
        long long mid = ok + (ng - ok) / 2;
        vector<long long> dist(n, 9e18);
        vector<bool> vis(n, false);
        priority_queue<pli, vector<pli>, greater<pli>> que;
        dist[0] = 0;
        que.push({0, 0});
        while (!que.empty()) {
            auto [d, u] = que.top();
            que.pop();
            if (vis[u]) {
                continue;
            }
            vis[u] = true;
            for (auto [v, a, b] : g[u]) {
                if (mid > b) {
                    continue;
                }
                if (dist[v] > d + a) {
                    dist[v] = d + a;
                    que.push({d + a, v});
                }
            }
        }
        if (dist[n - 1] <= x) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    cout << ok << endl;
}