n, k = map(int, input().split())
A = [*map(int, input().split())]
B = [*map(int, input().split())]
C = [*map(int, input().split())]

D = list()
for a, b in zip(A, B):
    D.append(a + b)
E = list()
for a, c in zip(A, C):
    E.append(a + c)

F = list()
for i in range(n):
    F.append((D[i], E[i]))

ans = 0
F.sort(reverse=True)
cnt = 0
idx = 0
s = set()
while True:
    if cnt == k or idx == n:
        break
    if F[idx][0] > F[idx][1]:
        ans += F[idx][0]
        cnt += 1
        s.add(idx)
    idx += 1

for i in range(n):
    if i not in s:
        ans += F[i][1]

print(ans)