def popcount(n):
    ret=0
    for i in range(65):
        if n&(1<<i):
            ret+=1
    return ret

N,M,K=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
INF=10**18
dp=[[INF]*(1<<N) for i in range(M+1)]

for i in range(1<<N):
    dp[0][i]=0
    for j in range(N):
        if (i&(1<<j)==0):
            dp[0][i]+=A[j]
            
pl=[[] for i in range(1<<N)]
mae=[[[] for _ in range(1<<N)] for _ in range(N)]

for i in range(1<<N):
    c=i
    while True:
        pl[i].append((popcount(i)-popcount(c))*K)
        if c==0:
            break
        c=(c-1)&i

for p in range(N):
    for i in range(1<<N):
        c=i
        while True:
            now=i
            now |= ((c * 2) - ((c * 2) & (1 << N)))
            now |= (((c * 2) & (1 << N)) >> N)
            now |= (c // 2)
            now |= (c % 2) * (1 << (N - 1))
            now -= (now & (1 << p))
            mae[p][i].append(now)
            if c==0:
                break
            c=(c-1)&i
        
for p in range(M):
    b=B[p]-1
    for i in range(1<<N):
        F=0
        c=i
        while True:
            dp[p+1][mae[b][i][F]]=min(dp[p+1][mae[b][i][F]],dp[p][i]+pl[i][F])
            F+=1
            if (c==0):
                break
            c=(c-1)&i

for i in range(M):
    print(dp[i+1][0])