#include <bits/stdc++.h>

typedef long long ll;
typedef double db;

const int MAX = 1e6 + 5;

int n, m; ll k; db ans;
struct E
{
	int u, v; ll s, t; db p; int id;
	bool operator < (const E & x) const { return s == x.s ? id > x.id : s > x.s; }
} e[MAX];

std::map <ll, db> f[MAX];

int main()
{
	scanf("%d%d%lld", &m, &n, &k);
	for (int i = 1; i <= m; ++i)
	{
		scanf("%d%d%lld%lld%lf", &e[i].u, &e[i].v, &e[i].s, &e[i].t, &e[i].p); e[i].id = i;
	}
	std::sort(e + 1, e + m + 1);
	f[1][k + 1] = 1;
	for (int i = 1; i <= m; ++i)
	{
		int u = e[i].u, v = e[i].v; ll s = e[i].s, t = e[i].t; db p = e[i].p;
		auto iu = f[u].upper_bound(s), iv = f[v].upper_bound(t); db pu = 0, pv = 0;
		if (iu != f[u].end()) { pu = iu -> second; }
		if (iv != f[v].end()) { pv = iv -> second; }
		f[u][s] = std::max(f[u][s], std::max(pu, pu * (1.0 - p) + pv * p));
	}
	for (auto i : f[0]) { ans = std::max(ans, i.second); }
	printf("%.10lf", ans);
}