import sys
readline=sys.stdin.readline
# Dinic's algorithm
from collections import deque

class Dinic:
    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]

    def add_edge(self, fr, to, cap):
        forward = [to, cap, None]
        forward[2] = backward = [fr, 0, forward]
        self.G[fr].append(forward)
        self.G[to].append(backward)

    def add_multi_edge(self, v1, v2, cap1, cap2):
        edge1 = [v2, cap1, None]
        edge1[2] = edge2 = [v1, cap2, edge1]
        self.G[v1].append(edge1)
        self.G[v2].append(edge2)

    def bfs(self, s, t):
        self.level = level = [None]*self.N
        deq = deque([s])
        level[s] = 0
        G = self.G
        while deq:
            v = deq.popleft()
            lv = level[v] + 1
            for w, cap, _ in G[v]:
                if cap and level[w] is None:
                    level[w] = lv
                    deq.append(w)
        return level[t] is not None

    def dfs(self, v, t, f):
        if v == t:
            return f
        level = self.level
        for e in self.it[v]:
            w, cap, rev = e
            if cap and level[v] < level[w]:
                d = self.dfs(w, t, min(f, cap))
                if d:
                    e[1] -= d
                    rev[1] += d
                    return d
        return 0

    def flow(self, s, t):
        flow = 0
        INF = 10**9 + 7
        G = self.G
        while self.bfs(s, t):
            *self.it, = map(iter, self.G)
            f = INF
            while f:
                f = self.dfs(s, t, INF)
                flow += f
        return flow

H,W=map(int,readline().split())
G=[list(map(int,readline().split())) for h in range(H)]
R=list(map(int,readline().split()))
C=list(map(int,readline().split()))
MFG=Dinic(H+W+2)
s=0
t=H+W+1
ans=0
for h in range(H):
    cost=sum(G[h][w] for w in range(W))-R[h]
    if cost>=0:
        MFG.add_edge(s,h+1,cost)
    else:
        MFG.add_edge(h+1,t,-cost)
        ans+=-cost
for w in range(W):
    cost=-C[w]
    if cost>=0:
        MFG.add_edge(s,w+H+1,cost)
    else:
        MFG.add_edge(w+H+1,t,-cost)
        ans+=-cost
for h in range(H):
    for w in range(W):
        MFG.add_edge(h+1,w+H+1,G[h][w])
flow=MFG.flow(s,t)
ans-=flow
print(ans)