#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

//#define ATCODER
#ifdef ATCODER
#include<atcoder/all>
using namespace atcoder;
#endif

#include <algorithm>
#include <utility>
#include <vector>

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64

#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 998244353;
constexpr int MAX = 4400000;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e17 + 1;
constexpr int INF = 1e9 + 1;



ll ad1[50], ad0[50];
void solve() {
	int N, Q; cin >> N >> Q;
	vector<int>A(N);
	REP(i, N)cin >> A[i];
	string S; cin >> S;
	REP(j, 30) {
		//bitが立ってる場合
		bool has = true;
		REP(i, N) {
			if (S[i] == '0') {
				if (A[i] & (1 << j)) {
					if (!has) {
						//ad1[j] += (1 << j);
						//has = true;
					}
				}
				else {
					if (has) {
						ad1[j] += (1 << j);
						has = false;
					}
				}
			}
			else {
				if (A[i] & (1 << j)) {
					if (!has) {
						ad1[j] += (1 << j);
						has = true;
					}
				}
				else {
					if (has) {
						//ad1[j] += (1 << j);
						//has = false;
					}
				}
			}
		}
		//bitが立ってない場合
		has = false;
		REP(i, N) {
			if (S[i] == '0') {
				if (A[i] & (1 << j)) {
					if (!has) {
						//ad0[j] += (1 << j);
						//has = true;
					}
				}
				else {
					if (has) {
						ad0[j] += (1 << j);
						has = false;
					}
				}
			}
			else {
				if (A[i] & (1 << j)) {
					if (!has) {
						ad0[j] += (1 << j);
						has = true;
					}
				}
				else {
					if (has) {
						//ad1[j] += (1 << j);
						//has = false;
					}
				}
			}
		}
	}
	REP(_, Q) {
		int t; cin >> t;
		ll res = 0;
		REP(j, 30) {
			if (t&(1 << j)) {
				res += ad1[j];
			}
			else res += ad0[j];
		}
		print(res);
	}
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	solve();

}