#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint n, Q;
llint a[100005];
string s;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> Q;
	for(int i = 1; i <= n; i++) cin >> a[i];
	cin >> s;
	s = "#" + s;
	
	llint sum = 0, x = 0;
	for(int i = 1; i <= n; i++){
		llint nx = x;
		if(s[i] == '0') nx &= a[i];
		else nx |= a[i];
		sum += abs(nx-x);
		x = nx;
	}
	llint mask = 0, mask2 = 0;
	for(int i = 0; i < 30; i++){
		for(int j = 1; j <= n; j++){
			if(s[j] == '0' && (a[j]&(1<<i)) == 0){
				mask |= 1<<i;
				mask2 |= 1<<i;
				break;
			}
			if(s[j] == '1' && (a[j]&(1<<i))){
				mask2 |= 1<<i;
				break;
			}
		}
	}
	
	llint t;
	for(int q = 0; q < Q; q++){
		cin >> t;
		llint ans = sum;
		for(int i = 0; i < 30; i++){
			if((t & (1<<i)) && (mask2 & (1<<i))){
				if(mask & (1<<i)) ans += 1<<i;
				else ans -= 1<<i;
			}
		}
		cout << ans << endl;
	}
	
	return 0;
}