n,m,k = map(int,input().split())
a = list(map(int,input().split())) 
b = list(map(int,input().split())) 

mask=(1<<n)-1
p=mask+1

def next(f,g):
    ret = f
    for i in range(n):
        if (f&(1<<i)) > 0:
            if(g&(1<<i)) == 0:
                j=(i+1)%n
                ret |= (1<<j)
                j=(i+n-1)%n
                ret |= (1<<j)
    return ret

def azuki_kurai(v,b):
    return v&(mask^(1<<b))

pc = [0]*p
for i in range(p):
    v=i
    for j in range(n):
        if i&(1<<j):
            pc[i]+=1


isin =[[] for _ in range(p)]
for i in range(p):
    for j in range(p):
        if i&j==j:
            isin[i].append(j)

nxt =[[0]*p for _ in range(p)]
for f in range(p):
    for g in isin[f]:
        nxt[f][g]=next(f,g)

dp = [0]*p
for i in range(p):
    dp[i]=0
    for j in range(n):
        if i & (1<<j) ==0:
            dp[i]+=a[j]

for _m in range(m):
    ndp=[10**18]*p
    _b=b[_m]-1
    for f in range(p):
        for g in isin[f]:
            nv = azuki_kurai(nxt[f][g],_b)
            ndp[nv]=min(ndp[nv],dp[f]+k*pc[g])
            #print(nv,f,g,ndp[nv],dp[f])
    dp=ndp
    print(dp[0])