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

#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)

#define int long long

#define INF 1e15

const int MAX_V = 2010; //必要な頂点数
struct Flow{
	struct edge{
		int to, cap, rev;
	};
	vector<edge> G[MAX_V];//隣接リスト
	bool used[MAX_V];
 
	void add_edge(int from, int to, int cap){
		G[from].push_back((edge){to, cap, (int)G[to].size()});//from -> to
		G[to].push_back((edge){from, 0, (int)G[from].size() - 1});//to -> from
	}
	//増加パスを探す
	int dfs(int v, int t, int f){
		if(v == t) return f;
		used[v] = true;
		for (int i = 0; i < G[v].size(); ++i){
			edge &e = G[v][i];
			if(!used[e.to] && e.cap > 0){
				int d = dfs(e.to, t, min(f, e.cap));
				if(d > 0){
					e.cap -= d;
					G[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}
	//sからtへの最大流
	int max_flow(int s, int t){
		int flow = 0;
		while(1){
			memset(used, 0, sizeof(used));
			int f = dfs(s, t, INF);
			if(f == 0) return flow;
			flow += f;
		}
	}
};



signed main(int argc, char const *argv[])
{
	int n, m, d; cin >> n >> m >> d;
	vector<int> u(m), v(m), p(m), q(m), w(m);
	rep(i, m) cin >> u[i] >> v[i] >> p[i] >> q[i] >> w[i];
	rep(i, m) u[i]--, v[i]--;
	int start = 2 * m, goal = 2 * m + 1;


	Flow fw;

	rep(i, m) {
		fw.add_edge(i, i + m, w[i]);
	}

	rep(i, m)rep(j, m) {
		if (i == j) continue;
		if (v[i] == u[j] && q[i] + d <= p[j]){
			fw.add_edge(i + m, j, INF + 1);
		}
	}

	// start
	rep(i, m) if(u[i] == 0) fw.add_edge(start, i, INF + 1);
	rep(i, m) if(v[i] == n - 1) fw.add_edge(i + m, goal, INF + 1);


	printf("%lld\n", fw.max_flow(start, goal));
	return 0;
}