#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Edge {
	int to;
	long long a;
	long long b;
	Edge(int _to, long long _a, long long _b) :to(_to), a(_a), b(_b) {}
};
vector<Edge>g[200005];
bool dikstra(int n, long long mid, long long x) {
	vector<long long> dp(n, LINF * 2);
	priority_queue<P, vector<P>, greater<P>> q;
	q.push({ 0, 0 });
	dp[0] = 0;
	while (!q.empty()) {
		auto tmp = q.top();
		q.pop();
		long long a = tmp.first;
		int pos = tmp.second;
		if (a > dp[pos]) continue;
		for (Edge e : g[pos]) {
			long long na = a + e.a;
			if (e.b < mid)continue;
			int npos = e.to;
			if (chmin(dp[npos], na)) q.push({ na, npos });
		}
	}
	return dp[n - 1] <= x;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	long long x; cin >> x;
	rep(i, m) {
		int u, v; cin >> u >> v; u--, v--;
		long long a, b; cin >> a >> b;
		g[u].emplace_back(v, a, b);
		g[v].emplace_back(u, a, b);
	}
	long long ok = -1;
	long long ng = LINF + 1;
	while (1 < abs(ok - ng)) {
		long long mid = (ng + ok) / 2;
		auto check = [&]() {
			return dikstra(n, mid, x);
		};
		if (check()) ok = mid;
		else ng = mid;
	}
	cout << ok << endl;
	return 0;
}