#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
from math import sin,cos
#from math import isqrt #DO NOT USE PyPy

ipt = sys.stdin.readline
iin = lambda :int(ipt())
lmin = lambda :list(map(int,ipt().split()))

#############################################################

N,M = lmin()
A = lmin()
B = lmin()
C = lmin()

D = defaultdict(int)
tmp = 0
sm = 0
SC = sum(C)
for i in range(N):
    D[A[i]-sm] += C[i]
    sm += B[i%M]

ans = 1<<60
for k,v in D.items():
    ans = min(ans,SC-v)
print(ans)