#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    string S;
    cin >> S;

    vector<long long> a0(30);
    vector<long long> a1(30);
    for (int d = 0; d < 30; d++) {
        int z = 0, o = 1;
        int sum0 = 0, sum1 = 0;
        for (int i = 0; i < N; i++) {
            if (S[i] == '0') {
                int sub_sum0 = z, sub_sum1 = o;
                z &= (A[i] >> d) & 1;
                o &= (A[i] >> d) & 1;
                sub_sum0 -= z; sub_sum1 -= o;
                sum0 += sub_sum0; sum1 += sub_sum1;
            } else {
                int sub_sum0 = -z, sub_sum1 = -o;
                z |= (A[i] >> d) & 1;
                o |= (A[i] >> d) & 1;
                sub_sum0 += z; sub_sum1 += o;
                sum0 += sub_sum0; sum1 += sub_sum1;
            }
        }
        a0[d] = sum0; a1[d] = sum1;
    }

    while (Q--) {
        int t;
        cin >> t;
        long long score = 0;
        for (int d = 0; d < 30; d++) {
            if (((t >> d) & 1) == 0) {
                score += a0[d] * (1 << d);
            } else {
                score += a1[d] * (1 << d);
            }
        }
        cout << score << endl;
    }
}