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

using ll = long long;

int main()
{
    cin.tie(0)->sync_with_stdio(0);

    int N, M, d;
    cin >> N >> M >> d;
    vector<int> u(M), v(M), p(M), q(M), w(M);
    vector<pair<int, int>> P;
    for (int i = 0; i < M; i++) {
        cin >> u[i] >> v[i] >> p[i] >> q[i] >> w[i];
        u[i]--;
        v[i]--;
        P.push_back({ u[i], p[i] });
        P.push_back({ v[i], q[i] + d });
    }
    sort(begin(P), end(P));
    atcoder::mf_graph<ll> G(ssize(P) + 2);
    for (int i = 0; i < M; i++) {
        int from = distance(begin(P), lower_bound(begin(P), end(P), make_pair(u[i], p[i])));
        int to = distance(begin(P), lower_bound(begin(P), end(P), make_pair(v[i], q[i] + d)));
        G.add_edge(from, to, w[i]);
    }
    for (int i = 0; i < ssize(P) - 1; i++) {
        if (P[i].first == P[i + 1].first) {
            G.add_edge(i, i + 1, LLONG_MAX);
        }
    }
    for (int i = 0; i < ssize(P); i++) {
        if (P[i].first == 0) {
            G.add_edge(ssize(P), i, LLONG_MAX);
        }
        if (P[i].first == N - 1) {
            G.add_edge(i, ssize(P) + 1, LLONG_MAX);
        }
    }
    cout << G.flow(ssize(P), ssize(P) + 1) << endl;
}