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

D = list()
idx_d = 0
for a, b in zip(A, B):
    D.append((a + b, 0, idx_d))
    idx_d += 1

idx_e = 0
E = list()
for a, c in zip(A, C):
    E.append((a + c, 1, idx_e))
    idx_e += 1

F = D + E
used = set()

ans = 0
F.sort(reverse=True)

cnt = 0
for i in range(len(F)):
    if F[i][2] not in used:
        if F[i][1] == 0:
            if cnt < k:
                ans += F[i][0]
                cnt += 1
                used.add(F[i][2])

            else:
                pass
        else:
            ans += F[i][0]
            used.add(F[i][2])

print(ans)