#include<bits/stdc++.h>

#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long hoge = 0; (hoge) < (n); ++ (hoge)) cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
const ll INF = LLONG_MAX/2;
const ll MOD = 1e9+7;

struct FordFulkerson {
    typedef long long flow_type;
    struct edge {
        int src, dst;
        flow_type capacity, flow;
        size_t rev;
    };
    int n;
    vector<vector<edge>> adj;
    FordFulkerson(int n) : n(n), adj(n) { }
    void add_edge(int src, int dst, flow_type capacity) {
        adj[src].push_back({src, dst, capacity, 0, adj[dst].size()});
        adj[dst].push_back({dst, src, 0, 0, adj[src].size()-1});
    }
    flow_type max_flow(int s, int t) {
        vector<bool> visited(n);
        function<flow_type(int,flow_type)> augment = [&](int u, flow_type cur) {
            if (u == t) return cur;
            visited[u] = true;
            for (auto &e: adj[u]) {
                if (!visited[e.dst] && e.capacity > e.flow) {
                    flow_type f = augment(e.dst, min(e.capacity - e.flow, cur));
                    if (f > 0) {
                        e.flow += f;
                        adj[e.dst][e.rev].flow -= f;
                        return f;
                    }
                }
            }
            return flow_type(0);
        };
        for (int u = 0; u < n; ++u)
            for (auto &e: adj[u]) e.flow = 0;

        flow_type flow = 0;
        while (1) {
            fill(visited.begin(),visited.end(), false);
            flow_type f = augment(s, INF);
            if (f == 0) break;
            flow += f;
        }
        return flow;
    }
};


signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll N,M,d;cin>>N>>M>>d;
  vll ti[N];
  vector<tuple<ll,ll,ll,ll,ll>> query(M);
  map<tuple<ll,ll>,ll> mp;
  int cnt=0;
  mp[make_tuple(0,0)]=cnt++;
  ti[0].push_back(0);
  for(ll i=0;i<M;i++){
    ll u,v,p,q,w;cin>>u>>v>>p>>q>>w;u--,v--;
    ti[u].push_back(p);
    if(mp.count(make_tuple(u,p))==0)mp[make_tuple(u,p)]=cnt++;
    ti[v].push_back(q+d);
    if(mp.count(make_tuple(v,q+d))==0)mp[make_tuple(v,q+d)]=cnt++;
    query[i]=make_tuple(u,v,p,q+d,w);
  }
  if(mp.count(make_tuple(N-1,1e9))==0)mp[make_tuple(N-1,1e9)]=cnt++;
  ti[N-1].push_back(1e9);
  FordFulkerson g(cnt);
  for(ll i=0;i<N;i++){
    sort(ti[i].begin(),ti[i].end());
    ti[i].erase(unique(ti[i].begin(),ti[i].end()),ti[i].end());
    for(ll j=0;j+1<(ll)ti[i].size();j++){
      g.add_edge(mp[make_tuple(i,ti[i][j])],mp[make_tuple(i,ti[i][j+1])],INF);
    }
  }
  for(ll i=0;i<M;i++){
    ll u,v,p,q,w;tie(u,v,p,q,w)=query[i];
    g.add_edge(mp[make_tuple(u,p)],mp[make_tuple(v,q)],w);
  }
  cout<<g.max_flow(mp[make_tuple(0,0)],mp[make_tuple(N-1,1e9)])<<endl;
  return 0;
}