import heapq
INF = 10**18
def dijkstra(s, edge):
    n = len(edge)
    dist = [INF]*n
    dist[s] = 0
    edgelist = []
    heapq.heappush(edgelist,(dist[s], s))
    while edgelist:
        minedge = heapq.heappop(edgelist)
        if dist[minedge[1]] < minedge[0]:
            continue
        v = minedge[1]
        for e in edge[v]:
            if dist[e[1]] > dist[v]+e[0]:
                dist[e[1]] = dist[v]+e[0]
                heapq.heappush(edgelist,(dist[e[1]], e[1]))
    return dist

n = int(input())
c = int(input())
a = int(input())
S = list(map(int, input().split()))
T = list(map(int, input().split()))
Y = list(map(int, input().split()))
M = list(map(int, input().split()))

N = n*(c+1)
edge = [[] for i in range(N)]
for i in range(a):
    s, t, y, m = S[i], T[i], Y[i], M[i]
    s, t = s-1, t-1
    for j in range(c+1):
        if j+y <= c:
            edge[n*j+s].append((m, n*(j+y)+t))

dist = dijkstra(0, edge)
ans = INF
for i in range(N):
    cost, v = divmod(i, n)
    if v == n-1:
        ans = min(dist[i], ans)
if ans < INF:
    print(ans)
else:
    print(-1)