#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N, Q;
    cin >> N >> Q;
    int A[N];
    rep(i, N) cin >> A[i];
    string S;
    cin >> S;
    ll ans[30][2];
    rep(i, 30){
        rep(k, 2){
            ans[i][k] = 0;
            int x = k<<i;
            rep(j, N){
                int y;
                if(S[j] == '0') y = ((x&A[j])&(1<<i)), ans[i][k] += x-y, x = y;
                else y = ((x|A[j])&(1<<i)), ans[i][k] += y-x, x = y;
            }
        }
    }
    while(Q--){
        int t;
        cin >> t;
        ll sum = 0;
        rep(i, 30){
            if(t & (1<<i)) sum += ans[i][1];
            else sum += ans[i][0];
        }
        cout << sum << endl;
    }
}