#include "bits/stdc++.h"
using namespace std;
//#include "atcoder/all"
//using namespace atcoder;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

signed main(){
	int N, Q;
	cin >> N >> Q;
	vector<int>a(N);
	cin >> a;
	string s;
	cin >> s;
	vector<int>q(Q);
	cin >> q;
	vector<vector<int>>v(30, vector<int>(2));
	REP(bit, 30) {
		int val = 1ll << bit;
		int cost = 0;
		REP(j, 2) {
			int now = j;
			REP(i, N) {
				int nex = -1;
				if(s[i] == '0') {
					nex = (now & (a[i] >> bit));
				} else {
					nex = (now | ((a[i] >> bit) & 1));
				}
				if(nex != now)v[bit][j] += val;
				now = nex;
			}
		}
	}
	REP(i, Q) {
		int sum = 0;
		REP(j, 30) {
			sum += v[j][!!((1ll << j) & q[i])];
		}
		out(sum);
	}

}