#include #define rep(i, p, n) for (ll i = p; i < (ll)(n); i++) #define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--) using namespace std; using ll = long long; using ld = long double; const double pi = 3.141592653589793; const long long inf = 2 * 1e9; const long long linf = 4 * 1e18; const ll mod1 = 1000000007; const ll mod2 = 998244353; template inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } // atcoder #include using namespace atcoder; using mint1 = modint1000000007; using mint2 = modint998244353; vector> base = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; int main() { ////////////////// ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ////////////////// ll N, M, K; cin >> N >> M >> K; vector A(N), B(M); rep(i, 0, N) { cin >> A.at(i); } rep(i, 0, M) { cin >> B.at(i); B.at(i)--; } mf_graph G(2 * N * M + N + 2); rep(i, 0, N) { G.add_edge(0, i + 1, A.at(i)); G.add_edge(2 * N * M + 1 + i, 2 * N * M + N + 1, linf); } rep(i, 0, M) { rep(j, 0, N) { G.add_edge(2 * N * i + 1 + j, 2 * N * i + N + 1 + j, K); if (B.at(i) != j) { G.add_edge(2 * N * i + 1 + j, 2 * N * (i + 1) + 1 + j, linf); } if (B.at(i) != (j + 1) % N) { G.add_edge(2 * N * i + N + 1 + j, 2 * N * (i + 1) + 1 + (j + 1) % N, linf); } if (B.at(i) != (j + N - 1) % N) { G.add_edge(2 * N * i + N + 1 + j, 2 * N * (i + 1) + 1 + (j + N - 1) % N, linf); } } } cout << G.flow(0, 2 * N * M + N + 1) << endl; return 0; }