rt

#include <bits/stdc++.h>

using namespace std;

const int N = 505;
const int inf = 0x3f3f3f3f;

struct Edge {
	int to, val, w, nxt;
} e[N << 1];

int n, m, x;
int head[N], cnt, mn = inf, K[N], dis[N];
bool vis[N];

void Add(int u, int v, int k, int w) {
	e[++cnt].nxt = head[u];
	head[u] = cnt;
	e[cnt].to = v;
	e[cnt].val = k;
	e[cnt].w = w;
}

void SPFA(int X) {
	memset(dis, 0x3f, sizeof dis); 
	dis[1] = 0;
	queue<int> q;
	q.push(1);
	vis[1] = true;
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		vis[u] = false;
		for(int i = head[u]; i; i = e[i].nxt) {
			int v = e[i].to;
			if(dis[v] > dis[u] + e[i].val && e[i].w >= X) {
				dis[v] = dis[u] + e[i].val;
				if(!vis[v]) {
					q.push(v);
				}
			}
		}
	}
}

int main() {
	cin >> n >> m >> x;
	for(int i = 1; i <= m; i++) {
		int u, v, k, w;
		scanf("%d%d%d%d", &u, &v, &w, &k);
		Add(u, v, k, w);
		Add(v, u, k, w);
		K[i] = k;
	}
	sort(K + 1, K + m + 1);
	for(int i = 1; i <= m; i++) {
		SPFA(K[i]);
		mn = min(mn, dis[n] + x / K[i]);
	}
	cout << mn << endl;
	return 0;
}