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

#include <atcoder/maxflow>
using namespace atcoder;

int main() {
    int n, m, d;
    cin >> n >> m >> d;

    vector<tuple<int, int, int, int, int>> planes(m);
    vector<vector<int>> us(n);
    us[0].push_back(0);
    us[n - 1].push_back(INT_MAX);
    for (auto& [u, v, p, q, w] : planes) {
        cin >> u >> v >> p >> q >> w;
        u--; v--;
        us[u].push_back(p);
        us[v].push_back(q + d);
    }

    vector<int> id(n + 1);
    for (int i = 0; i < n; ++i) {
        sort(us[i].begin(), us[i].end());
        us[i].erase(unique(us[i].begin(), us[i].end()), us[i].end());
        id[i + 1] = id[i] + (int)us[i].size();
    }

    mf_graph<long long> g(id[n]);
    int s = 0, t = id[n] - 1;

    for (int i = 0; i < n; ++i) {
        for (int u = id[i]; u + 1 < id[i] + (int)us[i].size(); ++u) {
            g.add_edge(u, u + 1, LLONG_MAX);
        }
    }

    for (auto [u, v, p, q, w] : planes) {
        int i = distance(us[u].begin(), lower_bound(us[u].begin(), us[u].end(), p));
        int j = distance(us[v].begin(), lower_bound(us[v].begin(), us[v].end(), q + d));
        g.add_edge(id[u] + i, id[v] + j, w);
    }

    cout << g.flow(s, t) << '\n';
}