#!/usr/bin/env python3 # from typing import * import sys import io import math import collections import decimal import itertools import bisect import heapq def input(): return sys.stdin.readline()[:-1] # sys.setrecursionlimit(1000000) # _INPUT = """2 3 # 1 2 3 # 4 5 6 # 6 2 # 1 7 3 # """ # sys.stdin = io.StringIO(_INPUT) class Dinic: def __init__(self, n): self.n = n self.links = [[] for _ in range(n)] self.depth = None self.progress = None def add_link(self, _from, to, cap): self.links[_from].append([cap, to, len(self.links[to])]) self.links[to].append([0, _from, len(self.links[_from]) - 1]) def bfs(self, s): depth = [-1] * self.n depth[s] = 0 q = collections.deque([s]) while q: v = q.popleft() for cap, to, rev in self.links[v]: if cap > 0 and depth[to] < 0: depth[to] = depth[v] + 1 q.append(to) self.depth = depth def dfs(self, v, t, flow): if v == t: return flow links_v = self.links[v] for i in range(self.progress[v], len(links_v)): self.progress[v] = i cap, to, rev = link = links_v[i] if cap == 0 or self.depth[v] >= self.depth[to]: continue d = self.dfs(to, t, min(flow, cap)) if d == 0: continue link[0] -= d self.links[to][rev][0] += d return d return 0 def max_flow(self, s, t): flow = 0 while True: self.bfs(s) if self.depth[t] < 0: return flow self.progress = [0] * self.n current_flow = self.dfs(s, t, INF) while current_flow > 0: flow += current_flow current_flow = self.dfs(s, t, INF) INF = 10**15 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())) mf = Dinic(H*W+H+W+2) S = 0 T = H*W+H+W+1 for h in range(H): for w in range(W): i = h*W+w+1 mf.add_link(S, i, G[h][w]) mf.add_link(i, T, 0) # 行ボーナス for h in range(H): k = H*W+1+h mf.add_link(k, T, R[h]) for w in range(W): i = h*W+w+1 mf.add_link(i, k, INF) # 列ボーナス for w in range(W): k = H*W+H+1+w mf.add_link(k, T, C[w]) for h in range(H): i = h*W+w+1 mf.add_link(i, k, INF) flow = mf.max_flow(S, T) score = sum(R) + sum(C) - flow print(score)