#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;
using ull = unsigned long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353;
constexpr int MAX = 5000000;

int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int n, kkt; cin >> n >> kkt;
	vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i];
	vector<ll> one(31), zero(31);
	string s; cin >> s;
	for (int bit = 0; bit < 31; bit++) {
		{
			ll cur = 1;
			for (int i = 0; i < s.size(); i++) {
				if (s[i] == '0') {
					if (!(a[i] >> bit & 1) and cur) {
						one[bit] += 1LL << bit;
						cur = 0;
					}
				}
				else {
					if ((a[i] >> bit & 1) and cur == 0) {
						one[bit] += 1LL << bit;
						cur = 1;
					}
				}
			}
		}
		{
			ll cur = 0;
			for (int i = 0; i < s.size(); i++) {
				if (s[i] == '0') {
					if (!(a[i] >> bit & 1) and cur) {
						zero[bit] += 1LL << bit;
						cur = 0;
					}
				}
				else {
					if ((a[i] >> bit & 1) and cur == 0) {
						zero[bit] += 1LL << bit;
						cur = 1;
					}
				}
			}
		}
	}

	while (kkt--) {
		ll t; cin >> t;
		ll res = 0;
		for (int i = 0; i < 31; i++) {
			if (t >> i & 1) {
				res += one[i];
			}
			else {
				res += zero[i];
			}
		}
		cout << res << "\n";
	}
}