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

int main() {
	int N, M;
	long long X;
	cin >> N >> M >> X;
	vector<int> u(M), v(M), b(M);
	vector<long long> a(M);
	vector<vector<int>> G(N, vector<int>());
	for( int i = 0; i < M; i++ ) {
		cin >> u[i] >> v[i] >> a[i] >> b[i];
		u[i]--, v[i]--;
		G[u[i]].push_back(i);
		G[v[i]].push_back(i);
	}
	auto f = [&](int W) -> bool {
		vector<bool> vis(N, false);
		vector<long long> d(N, 1LL<<59);
		priority_queue<pair<long long, int>> que;
		d[0] = 0;
		que.push(make_pair(0, 0));
		while( !que.empty() ) {
			auto [_d, cur] = que.top();
			que.pop();
			if( vis[cur] ) continue;
			vis[cur] = true;
			for( int i : G[cur] ) {
				int nxt = u[i]^v[i]^cur;
				if( !vis[nxt] && W <= b[i] && d[nxt] > d[cur]+a[i] ) {
					d[nxt] = d[cur]+a[i];
					que.push(make_pair(-d[nxt], nxt));
				}
			}
		}
		return d[N-1] <= X;
	};
	int ok = 0, ng = 1<<30;
	while( ok+1 < ng ) {
		int m = (ok+ng)/2;
		if( f(m) ) ok = m;
		else ng = m;
	}
	if( ok == 0 ) cout << -1 << endl;
	else cout << ok << endl;
}