from collections import deque

class Dinic:
    def __init__(self, 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):
        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
        links_v = self.links[v]
        for i in range(self.progress[v], len(links_v)):
            self.progress[v] = i
            cap, to, rev = link = 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
            link[0] -= d
            self.links[to][rev][0] += d
            return d
        return 0
 
    def max_flow(self, s, t):
        flow = 0
        while True:
            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'))
 
D={}
N,M,d=map(int, input().split())
D[1]=[0]
A=[]
for i in range(M):
  u,v,p,q,w=map(int, input().split())
  A.append((u,v,p,q,w))
  if u not in D:
    D[u]=[]
  D[u].append(p)  
  if v not in D:
    D[v]=[]
  D[v].append(q+d)

F={}
now=0;c=0
for i in range(1,N+1):
  if i in D:
    E=D[i]
    E=sorted(list(set(E)))
    D[i]=E;c+=len(E)
    for e in E:
      F[(i,e)]=now 
      now+=1 

mf=Dinic(c)
for u,v,p,q,w in A:
  x,y=F[(u,p)],F[(v,q+d)]
  mf.add_link(x,y,w)

for e in D:
  G=D[e]
  for i in range(len(G)-1):
    x,y=G[i],G[i+1]
    mf.add_link(F[(e,x)],F[(e,y)],10**12)

print(mf.max_flow(0,c-1))