#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

template<typename T>
struct Max_Flow{
    struct edge{
        int to; T cap; int rev;
        edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}
    };

    vector<vector<edge>> es;
    vector<bool> used;
    const T INF_T;

    Max_Flow(int n) : INF_T(numeric_limits<T>::max()){
        es.resize(n), used.resize(n);
    }

    void add_edge(int from, int to, T cap){
        es[from].eb(to, cap, sz(es[to]));
        es[to].eb(from, 0, sz(es[from])-1);
    }

    T dfs(int now, int t, T flow){
        if(now == t) return flow;
        used[now] = true;
        for(auto &e: es[now]){
            if(!used[e.to] && e.cap > 0){
                T f = dfs(e.to, t, min(flow, e.cap));
                if(f > 0){
                    e.cap -= f;
                    es[e.to][e.rev].cap += f;
                    return f;
                }
            }
        }
        return 0;
    }

    T max_flow(int s, int t){
        T flow = 0;
        for(;;){
            fill(all(used), false);
            T f = dfs(s, t, INF_T);
            if(f == 0) return flow;
            flow += f;
        }
    }
};

int main(){
    int N, M, D;
    cin >> N >> M >> D;
    int u[M], v[M], p[M], q[M]; ll w[M];
    vector<int> es[N], rs[N];
    rep(i, M){
        cin >> u[i] >> v[i] >> p[i] >> q[i] >> w[i];
        u[i]--, v[i]--, q[i] += D;
        es[u[i]].pb(i), rs[v[i]].pb(i);
    }

    int d1[N], d2[N];
    priority_queue<pii, vector<pii>, greater<pii> > que1;
    fill(d1, d1+N, INT_MAX);
    que1.emplace(d1[0] = 0, 0);
    while(!que1.empty()){
        int x, i;
        tie(x, i) = que1.top(); que1.pop();
        if(x > d1[i]) continue;
        for(auto &e: es[i]){
            if(p[e] < d1[i]) continue;
            if(chmin(d1[v[e]], q[e])) que1.emplace(d1[v[e]], v[e]);
        }
    }

    priority_queue<pii> que2;
    fill(d2, d2+N, -1);
    que2.emplace(d2[N-1] = 1000000000+D, N-1);
    while(!que2.empty()){
        int x, i;
        tie(x, i) = que2.top(); que2.pop();
        if(x < d2[i]) continue;
        for(auto &e: rs[i]){
            if(q[e] > d2[i]) continue;
            if(chmax(d2[u[e]], p[e])) que2.emplace(d2[u[e]], u[e]);
        }
    }

    Max_Flow<ll> G(N);
    rep(i, M){
        if(p[i] >= d1[u[i]] && q[i] <= d2[v[i]]){
            G.add_edge(u[i], v[i], w[i]);
        }
    }
    cout << G.max_flow(0, N-1) << endl;
}