#include <bits/stdc++.h>
using namespace std;

#define int ll
#define fast_io cin.tie(0)->sync_with_stdio(0);
#define endl '\n'
typedef long long ll;

int32_t main() {
	fast_io;

	int n, m, 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 l) {
		using T = pair<int, int>;
		priority_queue<T, vector<T>, greater<T>> pq;
		vector<int> dist(n, int(1e18));
		dist[0] = 0;
		pq.emplace(dist[0], 0);
		while (pq.size()) {
			auto [d, u] = pq.top(); pq.pop();
			if (d > dist[u]) continue;
			for (auto [v, a, b] : g[u]) {
				if (l <= b && dist[v] > dist[u] + a) {
					dist[v] = dist[u] + a;
					pq.emplace(dist[v], v);
				}
			}
		}
		return dist[n - 1] <= x;
	};

	int lo = -1, hi = 1e18;
	while (lo < hi) {
		int mid = (lo + hi + 1) / 2;
		if (check(mid)) lo = mid;
		else hi = mid - 1;
	}
	cout << lo << endl;
}