import sys,heapq
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


class Dijkstra_list():  # 1-based
    def __init__(self,N):
        self.N = N
        self.edges = [[] for _ in range(N+1)]

    def add(self,u,v,d,directed=False):
        if directed is False:  # 無向グラフの場合
            self.edges[u].append((v,d))
            self.edges[v].append((u,d))
        else:  # 有向グラフの場合
            self.edges[u].append((v,d))

    def delete(self,u,v):
        self.edges[u] = [_ for _ in self.edges[u] if _[0] != v]
        self.edges[v] = [_ for _ in self.edges[v] if _[0] != u]

    def search(self,s):  # sから各頂点までの最短距離
        inf = 10**18
        dist = [inf]*(self.N+1)
        # prev = [-1]*(self.N+1)
        dist[s] = 0
        q = []
        heapq.heappush(q,(0,s))
        flag = [0]*(self.N+1)
        while q:
            d,u = heapq.heappop(q)
            if flag[u]:
                continue
            flag[u] = 1

            for v,dd in self.edges[u]:
                if flag[v]:
                    continue
                new_d = d + dd
                if dist[v] > new_d:
                    dist[v] = new_d
                    heapq.heappush(q,(new_d,v))
                    # prev[v] = u
        return dist  # return dist,prev


N,C,V = I(),I(),I()
S,T,Y,M = LI(),LI(),LI(),LI()

Di = Dijkstra_list(N*(C+1))
for s,t,y,m in zip(S,T,Y,M):
    s -= 1
    t -= 1
    for c in range(y,C+1):
        Di.add((C+1)*s+c,(C+1)*t+(c-y),m,directed=True)

dist = Di.search(C)
ans = 10**18
for c in range(C+1):
    ans = min(ans,dist[(N-1)*(C+1)+c])

if ans == 10**18:
    ans = -1

print(ans)