#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/maxflow>

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, M, K;
    cin >> N >> M >> K;
    vector<ll> dp(1 << N);
    vector<ll> A(N);
    rep(i, 0, N){
        cin >> A[i];
    }
    vector<int> B(M);
    rep(i, 0, M) cin >> B[i], B[i]--;
    /*
    auto f = [&](int a, int b) -> int {
        b = (b + N) % N;
        return a * N + b;
    };
    rep(i, 0, M){
        atcoder::mf_graph<ll> G(N * (2 * i + 3) + 2);
        int S = N * (2 * i + 3);
        int T = S + 1;
        rep(j, 0, N) G.add_edge(S, j, A[j]), G.add_edge(S - 1 - j, T, ILL);
        rep(j, 0, i + 1){
            rep(k, 0, N){
                G.add_edge(f(2 * j, k), f(2 * j + 2, k), (B[j] == k ? 0 : ILL));
                G.add_edge(f(2 * j, k), f(2 * j + 1, k), K);
                G.add_edge(f(2 * j + 1, k), f(2 * j + 2, k - 1), B[j] == f(0, k - 1) ? 0 : ILL);
                G.add_edge(f(2 * j + 1, k), f(2 * j + 2, k + 1), B[j] == f(0, k + 1) ? 0 : ILL);
            }
        }
        auto ans = G.flow(S, T);
        cout << ans << "\n";
    }
    */
    rep(i, 0, 1 << N) rep(j, 0, N) if (i & (1 << j)) dp[i] += A[j];
    vector<vector<int>> p(N);
    rep(i, 0, N) p[i].push_back(((i + 1) % N)), p[i].push_back((i + N - 1) % N);
    rep(rp, 0, M){
        int b = B[rp];
        vector<ll> n_dp(1 << N, ILL);
        rep(fr, 0, 1 << N){
            int T = (fr & ((1 << N) - 1 - (1 << b))) + (1 << b);
            for (int to = T; to >= 0; to--){
                to = (to & T);
                ll tmp = dp[fr];
                rep(k, 0, N){
                    if (fr & (1 << k)) continue;
                    for (auto x : p[k]){
                        if ((to & (1 << x)) != 0 && b != x){
                            tmp += K;
                            break;
                        }
                    }
                }
                chmin(n_dp[to], tmp);
            }
        }
        swap(n_dp, dp);
        cout << dp[(1 << N) - 1] << "\n";
    }
}