#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) {
            os << ',';
        }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

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;

    // i番目のbitが0の時と1の時のスコアをそれぞれ前計算
    vector memo(32, vector(2, 0LL));
    for(int i = 0; i < 32; i++) {
        // 最初が0のとき
        int now = 0;
        for(int j = 0; j < N; j++) {
            if(s[j] == '1') {
                if(now == 0 && ((a[j] & (1 << i)) > 0)) {
                    memo[i][0] += (1 << i);
                }
                now = (now | (((a[j] & (1 << i)) > 0)));
            } else {
                if(now == 1 && ((a[j] & (1 << i)) == 0)) {
                    memo[i][0] += (1 << i);
                }
                now = (now & (((a[j] & (1 << i)) > 0)));
            }
        }
        // 1のとき
        now = 1;
        for(int j = 0; j < N; j++) {
            if(s[j] == '1') {
                if(now == 0 && ((a[j] & (1 << i)) > 0)) {
                    memo[i][1] += (1 << i);
                }
                now = (now | (((a[j] & (1 << i)) > 0)));
            } else {
                if(now == 1 && ((a[j] & (1 << i)) == 0)) {
                    memo[i][1] += (1 << i);
                }
                now = (now & (((a[j] & (1 << i)) > 0)));
            }
        }
    }

    while(Q--) {
        int t;
        cin >> t;
        ll ans = 0;
        for(int i = 0; i < 32; i++) {
            ans += memo[i][(t & (1 << i)) > 0];
        }
        cout << ans << "\n";
    }
}