import std.stdio, std.array, std.string, std.conv, std.algorithm; import std.typecons, std.range, std.random, std.math, std.container; import std.numeric, std.bigint, core.bitop, core.stdc.string; void main(){ auto s = readln.split.map!(to!int); auto H = s[0]; auto W = s[1]; auto A = iota(H).map!(_ => readln.split.map!(to!long).array).array; auto R = readln.split.map!(to!long).array; auto C = readln.split.map!(to!long).array; int source = H + W; int sink = H + W + 1; auto ff = new Dinic(H+W+2, source, sink); foreach (i; 0..H) { ff.add_edge(source, i, A[i].sum); ff.add_edge(i, sink, R[i]); } foreach (j; 0..W) { ff.add_edge(H+j, sink, C[j]); } foreach (i; 0..H) foreach (j; 0..W) { ff.add_edge(i, H+j, A[i][j]); } writeln(R.sum + C.sum - ff.run); } class Dinic { import std.typecons : Tuple; import std.conv : to; import std.container : DList; import std.algorithm : min; alias Edge = Tuple!(int, "to", long, "cap", long, "rev"); immutable long INF = 10^^15; int V, source, sink; Edge[][] G; int[] itr, level; this(int V, int s, int t) { this.V = V; G = new Edge[][](V); source = s; sink = t; } void add_edge(int from, int to, long cap) { G[from] ~= Edge(to, cap, G[to].length.to!long); G[to] ~= Edge(from, 0, G[from].length.to!long-1); } void bfs(int s) { level = new int[](V); level[] = -1; DList!int q; level[s] = 0; q.insertBack(s); while (!q.empty) { int v = q.front(); q.removeFront(); foreach (e; G[v]){ if (e.cap > 0 && level[e.to] < 0) { level[e.to] = level[v] + 1; q.insertBack(e.to); } } } } long dfs(int v, int t, long f) { if (v == t) return f; for (int i = itr[v]; i < G[v].length.to!int; ++i) { if (G[v][i].cap > 0 && level[v] < level[G[v][i].to]) { long d = dfs(G[v][i].to, t, min(f, G[v][i].cap)); if (d > 0) { G[v][i].cap -= d; G[G[v][i].to][G[v][i].rev].cap += d; return d; } } } return 0; } long run() { long ret = 0, f; while (true) { bfs(source); if (level[sink] < 0) break; itr = new int[](V); while ((f = dfs(source, sink, INF)) > 0) ret += f; } return ret; } }