import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } class MaxFlow(Capa, Capa CAPA_EPS = 0, Capa CAPA_INF = 10^^9) { int n, m; int[][] g; int[] zu; Capa[] capa; Capa tof; int[] lev, see, que; this(int n) { this.n = n; m = 0; g = new int[][n]; zu = []; capa = []; lev = new int[n]; see = new int[n]; que = new int[n]; } void ae(int u, int v, Capa w0, Capa w1 = 0) { g[u] ~= m; zu ~= v; capa ~= w0; ++m; g[v] ~= m; zu ~= u; capa ~= w1; ++m; } Capa augment(int src, int ink, Capa flo) { if (src == ink) return flo; foreach (i; g[src][see[src] .. $]) { if (capa[i] > CAPA_EPS && lev[src] < lev[zu[i]]) { Capa f = augment(zu[i], ink, min(flo, capa[i])); if (f > CAPA_EPS) { capa[i] -= f; capa[i ^ 1] += f; return f; } } ++see[src]; } return 0; } bool dinic(int src, int ink, Capa flo = CAPA_INF) { for (tof = 0; tof + CAPA_EPS < flo; ) { int qb, qe; lev[] = -1; dinicBFS: for (lev[src] = 0, que[qe++] = src; qb != qe; ) { const u = que[qb++]; foreach (i; g[u]) { const v = zu[i]; if (capa[i] > CAPA_EPS && lev[v] == -1) { lev[v] = lev[u] + 1; que[qe++] = v; if (v == ink) break dinicBFS; } } } if (lev[ink] == -1) return false; see[] = 0; for (; ; ) { Capa f = augment(src, ink, flo - tof); if (f <= CAPA_EPS) break; tof += f; } } return true; } } enum INF = 10L^^18; void main() { try { for (; ; ) { const N = readInt; const ALen = readInt; const BLen = readInt; auto A = new int[ALen]; foreach (i; 0 .. ALen) A[i] = readInt - 1; auto B = new int[BLen]; foreach (i; 0 .. BLen) B[i] = readInt - 1; auto C = new long[][](N, N); foreach (u; 0 .. N) foreach (v; 0 .. N) { C[u][v] = readLong; } long ans; auto mf = new MaxFlow!(long, 0, INF)(N + 2); foreach (u; A) mf.ae(N, u, INF); foreach (u; B) mf.ae(u, N + 1, INF); foreach (u; 0 .. N) foreach (v; u + 1 .. N) { ans += C[u][v]; mf.ae(u, v, C[u][v], C[u][v]); } mf.dinic(N, N + 1); ans -= mf.tof; writeln(ans); } } catch (EOFException e) { } }