#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()

int main(){
	int n, q; cin >> n >> q;
	VI a(n); REP(i,n) cin >> a[i];
	string s; cin >> s;
	VVI p(33,VI(2,0));
	int now0, now1;
	int b0, b1;
	for(int i=0;i<=32;i++){
		now0=0; now1=1;
		REP(j,n){
			b0=now0; b1=now1;
			if(s[j]=='0'){
				now0&=(a[j]>>i&1);
				now1&=(a[j]>>i&1);
			}
			else{
				now0|=(a[j]>>i&1);
				now1|=(a[j]>>i&1);
			}
			p[i][0]+=(now0^b0)*(1ll<<i);
			p[i][1]+=(now1^b1)*(1ll<<i);
		}
	}
	ll t; ll ans;
	while(q--){
		cin >> t;
		ans=0;
		REP(i,33) ans+=p[i][t>>i&1];
		cout << ans << endl;
	}
	return 0;
}