#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
#include<stack>
#include<iomanip>
#include<queue>
#include<set>
#include<functional>
#include<tuple>
#include<bitset>
#include<cassert>
#include<cstdint>
#include<complex>
#include<random>
using namespace std;
bool printb(bool f) {
	if (f)printf("Yes\n");
	else printf("No\n");
	return f;
}
template<class T>
void prt(T t = "", string sep = "\n") { cout << t << sep; return; }
template<class T>
void printl(vector<T> a, string sep = " ") {
	for (int i = 0; i < a.size(); i++) {
		cout << a[i];
		if (i != a.size() - 1)cout << sep;
	}
	if (sep != "\n")cout << "\n";
	return;
}
bool prt_isfixed = false;
template<class T>
void prt_fix(T t, string sep = "\n") {
	if (!prt_isfixed) {
		cout << fixed << setprecision(15);
		prt_isfixed = true;
	}
	prt(t, sep);
}
#define all(a) a.begin(),a.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using uint = unsigned int;
using llong = long long;
using ullong = unsigned long long;
using pii = pair<int, int>;
using pll = pair<llong, llong>;
using pli = pair<llong, int>;
using pil = pair<int, llong>;
template<typename T> using vec2 = vector<vector<T>>;
template<typename T> inline bool chmin(T& a, T b) { return (a > b) ? (a = b, true) : false; }
template<typename T> inline bool chmax(T& a, T b) { return (a < b) ? (a = b, true) : false; }
bool bitIn(llong a, int b) { return ((a >> b) & 1); }
int bitCnt(llong a) {
	int re = 0;
	while (a > 0) {
		if (a & 1)re++;
		a >>= 1;
	}
	return re;
}
llong powL(llong n, llong i) {
	llong re = 1;
	while (i >= 1) {
		if (i & 1) re *= n;
		n *= n;
		i >>= 1;
	}
	return re;
}

llong powL_M(llong n, llong i, llong mod) {
	llong re = 1;
	while (i >= 1) {
		if (i & 1) {
			re *= n;
			re %= mod;
		}
		n *= n;
		n %= mod;
		i >>= 1;
	}
	return re;
}

int  dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int dx8[8] = { 0,1,1,1,0,-1,-1,-1 }, dy8[8] = { -1,-1,0,1,1,1,0,-1 };



int main() {
	int n, m;
	llong x;
	cin >> n >> m >> x;
	using T = tuple<int, int, int>;
	vec2<T> g(n);
	rep(i, m) {
		int u, v, a, b;
		scanf("%d %d %d %d", &u, &v, &a, &b);
		u--; v--;
		g[u].emplace_back(v, a, b);
		g[v].emplace_back(u, a, b);
	}

	int ok = -1, ng = 1e9 + 100;
	while (abs(ok - ng) != 1) {
		int mid = (ok + ng) / 2;
		priority_queue<pli, vector<pli>, greater<pli>> q;
		q.emplace(0, 0);
		vector<llong> dis(n,1e18);
		dis[0] = 0;
		while (!q.empty()) {
			auto [d, v] = q.top(); q.pop();
			if (dis[v]< d)continue;

			for (auto [to, co, wid] : g[v]) {
				if (wid < mid)continue;
				if (chmin(dis[to], dis[v] + co))q.emplace(dis[v] + co, to);
			}
		}
		if (dis[n - 1] >x)ng = mid;
		else ok = mid;
	}
	prt(ok);
}