from collections import deque
import sys
sys.setrecursionlimit(10**8)
import pypyjit
pypyjit.set_param("max_unroll_recursion=-1")
 
class Dinic:
    def __init__(self, n):
        """n点ネットワークの構築"""
        self.n = n
        self.links = [[] for _ in range(n)]
        self.depth = None
        self.progress = None
 
    def add_link(self, _from, to, cap):
        """フローが流れてない状態での辺の追加"""
        self.links[_from].append([cap, to, len(self.links[to])])
        self.links[to].append([0, _from, len(self.links[_from]) - 1])
 
    def bfs(self, s):
        """sからtへの残余ネットワーク上での最短距離"""
        depth = [-1] * self.n
        depth[s] = 0
        q = deque([s])
        while q:
            v = q.popleft()
            for cap, to, rev in self.links[v]:
                if cap > 0 and depth[to] < 0:
                    depth[to] = depth[v] + 1
                    q.append(to)
        self.depth = depth
 
    def dfs(self, v, t, flow):
        """増大道の探索"""
        if v == t:
            return flow
        for i in range(self.progress[v], len(self.links[v])):
            self.progress[v] = i
            cap, to, rev = self.links[v][i]
            if cap == 0 or self.depth[v] >= self.depth[to]:
                continue
            d = self.dfs(to, t, min(flow, cap))
            if d == 0:
                continue
            # 残余ネットワークの更新
            self.links[v][i][0] -= d
            self.links[to][rev][0] += d
            return d
        return 0
 
    def max_flow(self, s, t):
        """最大フローを求める"""
        flow = 0
        while True:
            # tに到達できるか
            self.bfs(s)
            if self.depth[t] < 0:
                return flow
            self.progress = [0] * self.n
            current_flow = self.dfs(s, t, float('inf'))
            while current_flow > 0:
                flow += current_flow
                current_flow = self.dfs(s, t, float('inf'))

N, M, d = map(int, input().split())
G = [set() for _ in range(N)]
G[0].add(0)
G[-1].add(10**9)
edge = []
for i in range(M):
    u, v, p, q, w = map(int, input().split())
    u-=1;v-=1
    G[u].add(p)
    G[v].add(q+d)
    edge.append([u, v, p, q, w])
ver = {}
ver[(0,0)] = 0
for i in range(N):
    G[i] = list(G[i])
    G[i].sort()

for i in range(N):
    for j in range(len(G[i])):
        ver[(i, G[i][j])] = len(ver)

dinic = Dinic(len(ver))
for i in range(N):
    for j in range(len(G[i])-1):
        dinic.add_link(ver[(i, G[i][j])], ver[(i, G[i][j+1])], float('inf'))

for u, v, p, q, w in edge:
    dinic.add_link(ver[(u, p)], ver[(v, q+d)], w)

print(dinic.max_flow(ver[(0,0)],ver[(N-1,10**9)]))