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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const K = readLong;
      auto A = new long[N];
      foreach (u; 0 .. N) {
        A[u] = readLong;
      }
      auto B = new int[M];
      foreach (i; 0 .. M) {
        B[i] = readInt - 1;
      }
      
      auto cost = new long[][](1 << N, 1 << N);
      foreach (h; 0 .. 1 << N) {
        for (int g = h; ; --g &= h) {
          foreach (u; 0 .. N) {
            const v0 = (u + 1) % N;
            const v1 = (u - 1 + N) % N;
            if ((g >> u & 1) && (!(h >> v0 & 1) || !(h >> v1 & 1))) {
              cost[h][g] += K;
            }
          }
          if (!g) break;
        }
        debug writefln("cost[%s] = %s", h, cost[h]);
      }
      
      // 1: s-side, 0: t-side
      auto crt = new long[1 << N];
      foreach (h; 0 .. 1 << N) {
        foreach (u; 0 .. N) if (!(h >> u & 1)) crt[h] += A[u];
      }
      foreach (b; B) {
        // INF or K
        {
          auto nxt = new long[1 << N];
          nxt[] = INF;
          foreach (h; 0 .. 1 << N) {
            for (int g = h; ; --g &= h) {
              chmin(nxt[h], crt[g] + cost[h][g]);
              if (!g) break;
            }
          }
          debug writeln(nxt);
          crt = nxt;
        }
        // INF except for b
        {
          auto nxt = new long[1 << N];
          nxt[] = INF;
          foreach (h; 0 .. 1 << N) {
            for (int g = h; ; --g &= h) {
              chmin(nxt[h], crt[g]);
              chmin(nxt[h], crt[g | 1 << b]);
              if (!g) break;
            }
          }
          debug writeln(nxt);
          crt = nxt;
        }
        // INF to 0
        writeln(crt[0]);
      }
    }
  } catch (EOFException e) {
  }
}