n, c, v = [input() for i in xrange(3)]
s, t, y, m = [map(int, raw_input().split()) for i in xrange(4)]
g = [[] for i in xrange(n+1)]
for i in xrange(v):
    g[s[i]].append((t[i], y[i], m[i]))

dp = [[-1]*(c+1) for i in xrange(n)]
INF = 10**9
def dfs(p, r):
    if p==n: return 0
    if dp[p][r] != -1: return dp[p][r]
    res = INF
    for(t,y,m)in g[p]:
        if y<=r: res = min(res, dfs(t, r-y) + m)
    dp[p][r] = res
    return res
r = dfs(1, c)
print -(r==INF) or r