#if __INCLUDE_LEVEL__ == 0 #include using namespace std; #undef assert #define assert(expr) (expr) || (__builtin_unreachable(), 0) #include __BASE_FILE__ namespace std::ranges::views { namespace { void solve() { int n, s, t; cin >> tie(n, s, t); vector color(n); while (s--) { int i; cin >> i; --i; color[i] = 1; } while (t--) { int i; cin >> i; --i; color[i] = 2; } s = n; t = s + 1; atcoder::mf_graph g(t + 1); int64_t ans = 0; for (int i : iota(0, n)) { for (int j : iota(0, n)) { int c; cin >> c; if (i < j) { ans += c; if (color[i] && color[i] == color[j]) { continue; } g.add_edge(i, j, c); g.add_edge(j, i, c); } } } for (int i : iota(0, n)) { if (color[i] == 1) { g.add_edge(s, i, 1e18); } else if (color[i] == 2) { g.add_edge(i, t, 1e18); } } ans -= g.flow(s, t); cout << ans << '\n'; } } // namespace } // namespace std::ranges::views using views::solve; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); } #else // __INCLUDE_LEVEL__ #include namespace std { template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } template istream& operator>>(istream& is, tuple& t) { return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t); } template istream& operator>>(istream& is, tuple&& t) { return is >> t; } template >* = nullptr> auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) { for (auto&& e : r) { is >> e; } return is; } template ostream& operator<<(ostream& os, const pair& p) { return os << p.first << ' ' << p.second; } template ostream& operator<<(ostream& os, const tuple& t) { auto f = [&os](const auto&... xs) -> ostream& { [[maybe_unused]] auto sep = ""; ((os << exchange(sep, " ") << xs), ...); return os; }; return apply(f, t); } template >* = nullptr> auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) { auto sep = ""; for (auto&& e : r) { os << exchange(sep, " ") << e; } return os; } } // namespace std #endif // __INCLUDE_LEVEL__