def solve(k, init):
    res = 0
    bit = init
    for i, flag in enumerate(s):
        if flag == "0":
            if bit == 1 and (a[i] >> k) & 1 == 0:
                res += 1
                bit = 0
        elif flag == "1":
            if bit == 0 and (a[i] >> k) & 1:
                res += 1
                bit = 1
    return res * (1 << k)


n, q = map(int, input().split())
a = list(map(int, input().split()))
s = input()
t = list(map(int, input().split()))


ans = [0] * q
for k in range(65):
    init0 = solve(k, 0)
    init1 = solve(k, 1)
    for i, val in enumerate(t):
        if (val >> k) & 1:
            ans[i] += init1
        else:
            ans[i] += init0
for res in ans:
    print(res)