#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

vec a;
vector<bool> s;

void solve(int f, int bit, ll &res){
    rep(i, N){
        int nx = s[i] ? f|((a[i]>>bit)&1) : f&((a[i]>>bit)&1);
        res += f != nx ? (1LL<<bit) : 0;
        f = nx;
    }
}

int main() {
    cin>>N>>Q;
    a.resize(N); s.resize(N);
    rep(i, N) cin>>a[i];
    cin>>S;
    rep(i, N) s[i] = S[i] == '1';
    mat memo(2, vec(30, 0));
    rep(i, 2) rep(j, 30) solve(i, j, memo[i][j]);
    rep(_, Q){
        cin>>A;
        ll res(0);
        rep(i, 30) res += memo[(A>>i)&1][i];
        cout<<res<<endl;
    }
}