#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  int s = (2 * n + 1) * (m + 1);
  mf_graph<ll> g(s + 1);
  constexpr long long INF = 1002003004005006007;
  rep(j, n) {
    int x;
    cin >> x;
    g.add_edge(s, n + j, x);
    g.add_edge(n + j, n + n, INF);
  }
  ll now = g.flow(s, n + n);
  rep(i, m) {
    int b;
    cin >> b;
    b--;
    int t1 = (2 * n + 1) * i, t2 = (2 * n + 1) * (i + 1);
    g.add_edge(s, t1 + n + n, now);
    rep(j, n) {
      if (j != b) g.add_edge(t1 + n + j, t2 + n + j, INF);
      g.add_edge(t1 + n + j, t2 + j, k);
      int j1 = (j + 1) % n, j2 = (j + n - 1) % n;
      if (j1 != b) g.add_edge(t2 + j, t2 + n + j1, INF);
      if (j2 != b) g.add_edge(t2 + j, t2 + n + j2, INF);
      g.add_edge(t2 + n + j, t2 + n + n, INF);
    }
    now = g.flow(s, t2 + n + n);
    cout << now << '\n';
  }
}