#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

int64_t solve1(int n, const vector<int64_t>& a, string s, int k, int64_t t) {
    int64_t ans = 0;
    int64_t x = t;
    REP (i, n) {
        int64_t nx;
        if (s[i] == '0') {
            nx = x & a[i];
        } else if (s[i] == '1') {
            nx = x | a[i];
        } else {
            assert (false);
        }
        nx &= 1ll << k;
        ans += abs<int64_t>(nx - x);
        x = nx;
    }
    return ans;
}

vector<int64_t> solve(int n, int q, const vector<int64_t>& a, string s, const vector<int64_t>& t) {
    array<array<int64_t, 2>, 60> f;
    REP (i, 60) {
        f[i][0] = solve1(n, a, s, i, 0);
        f[i][1] = solve1(n, a, s, i, 1ll << i);
    }
    vector<int64_t> ans(q);
    REP (j, q) {
        REP (i, 60) {
            ans[j] += f[i][not not (t[j] & (1ll << i))];
        }
    }
    return ans;
}

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
    int N, Q; cin >> N >> Q;
    vector<int64_t> A(N);
    REP (i, N) { cin >> A[i]; }
    string S;
    cin >> S;
    vector<int64_t> t(Q);
    REP (i, Q) { cin >> t[i]; }
    auto ans = solve(N, Q, A, S, t);
    REP (i, Q) { cout << ans[i] << endl; }
    return 0;
}