#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M;
    ll X;
    cin >> N >> M >> X;
    vector<vector<tuple<int, int, int>>> G(N);
    for (; M--;) {
        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 x) -> bool {
        vector<ll> dp(N, IINF);
        priority_queue<pair<ll, int>> pq;
        dp[0] = 0;
        pq.emplace(0, 0);
        while (not pq.empty()) {
            auto [val, v] = pq.top();
            pq.pop();
            val *= -1;
            if (dp[v] != val) continue;
            for (auto [u, a, b] : G[v]) {
                if (b < x) continue;
                if (chmin(dp[u], val + a)) pq.emplace(-dp[u], u);
            }
        }
        return dp[N - 1] <= X;
    };

    int lb = -1, ub = INF;
    while (ub - lb > 1) {
        int mid = (ub + lb) >> 1;
        (check(mid) ? lb : ub) = mid;
    }

    cout << lb << '\n';
    return 0;
}