H, W = map(int, input().split())
G = [list(map(int, input().split())) for _ in range(H)]
R = list(map(int, input().split()))
C = list(map(int, input().split()))

a = [R[i] - sum(row) for i, row in enumerate(G)]

sum_col = [0] * W
for j in range(W):
    for i in range(H):
        sum_col[j] += G[i][j]
b = [C[j] - sum_col[j] for j in range(W)]

c = [0] * W
profit = sum(max(0, b[j] + c[j]) for j in range(W))
selected = set()

while True:
    max_delta = -float('inf')
    best_i = -1
    for i in range(H):
        if i not in selected:
            current_delta = a[i]
            for j in range(W):
                prev = b[j] + c[j]
                new_val = prev + G[i][j]
                delta_j = max(0, new_val) - max(0, prev)
                current_delta += delta_j
            if current_delta > max_delta:
                max_delta = current_delta
                best_i = i
    if max_delta > 0:
        selected.add(best_i)
        for j in range(W):
            c[j] += G[best_i][j]
        profit += max_delta
    else:
        break

print(profit)