#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;

ll V;
const ll INF = 1LL << 60;
const int MAX_V = 2100;

using P = pair<ll, ll>;

//// {行き先, 容量, 逆辺}
//// {to, cap, rev}
//// G[v][to] <-> G[to][rev]
using Edge = tuple<int, ll, int>;
vector<Edge> G[MAX_V];

bool used[MAX_V];

//// G に辺と逆辺を追加
void add_edge(int from, int to, ll cap){
    G[from].push_back(Edge(to, cap, G[to].size()));
    G[to].push_back(Edge(from, 0, G[from].size()-1));
}

//// 増加パスをdfsで探索
//ll find_path(int v, int t, ll f, auto& used){
ll find_path(int v, int t, ll f){
    if(v == t) return f;
    used[v] = true;
    for(auto& [to, cap, rev] : G[v]){
        if(!used[to] && cap > 0){
            //ll d = find_path(to, t, min(f, cap), used);
            ll d = find_path(to, t, min(f, cap));
            if(d > 0){
                cap -= d;
                get<1>(G[to][rev]) += d;
                return d;
            }
        }
    }
    return 0; 
}

//// sからtへの最大流を求める
ll max_flow(int s, int t){
    ll flow = 0;
    //array<bool, MAX_V> used;
    while(1){
        //fill(used.begin(), used.end(), false);
        fill(used, used+V, false);
        //ll f = find_path(s, t, INF, used);
        ll f = find_path(s, t, INF);
        if(f == 0) break;
        flow += f;
    }
    return flow;
}

int main(){
    ll N, M, D;
    cin >> N >> M >> D;
    using T = tuple<ll, ll, ll, ll, ll>;
    vector<T> X;
    REP(i,M){
        ll u, v, p, q, w;
        //cin >> u >> v >> p >> q >> w;
        scanf("%lld %lld %lld %lld %lld", &u, &v, &p, &q, &w);
        u--, v--;
        X.push_back(T(u, v, p, q, w));
    }

    vector<vector<int>> vertex(N);
    vertex[0].push_back(0);
    vertex[N-1].push_back(1000000000LL);

    for(auto& [u, v, p, q, w] : X){
        vertex[u].push_back(p);
        vertex[v].push_back(q+D);
    }

    map<P, int> pos2idx;
    ll cnt = 0;
    REP(v, N){
        sort(vertex[v].begin(), vertex[v].end());
        vertex[v].erase(unique(vertex[v].begin(), vertex[v].end()), vertex[v].end());
        int size = vertex[v].size();
        REP(i, size){
            pos2idx[P(v, vertex[v][i])] = cnt++;
        }
    }

    for(auto& [u, v, p, q, w] : X){
        auto v0 = pos2idx[P(u, p)];
        auto v1 = pos2idx[P(v, q+D)];
        add_edge(v0, v1, w);
    }

    REP(v, N){
        int size = vertex[v].size();
        REP(i, size-1){
            auto v0 = pos2idx[P(v, vertex[v][i])];
            auto v1 = pos2idx[P(v, vertex[v][i+1])];
            add_edge(v0, v1, INF);
        }
    }

    V = cnt;

    ll ans = max_flow(0, cnt-1);
    cout << ans << endl;
    return 0;
}