//実家
#include <iostream>
#include <string>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n, q;
int a[100000];
string s;
int t[100000];
int memo[30][2];

signed main() {
	int i, j, k;
	
	cin >> n >> q;
	rep(i, n) cin >> a[i];
	cin >> s;
	rep(i, q) cin >> t[i];
	
	rep(i, 30) {
		rep(j, 2) {
			int x = j;
			int rng = 0;
			rep(k, n) {
				int val = (a[k] >> i) % 2;
				int nx;
				if (s[k] == '0') {
					nx = (x & val);
				}
				else {
					nx = (x | val);
				}
				rng += abs(nx - x);
				x = nx;
			}
			memo[i][j] = rng;
		}
	}
	
	rep(i, q) {
		int ans = 0;
		rep(j, 30) {
			ans += (memo[j][(t[i] >> j) % 2] << j);
		}
		cout << ans << endl;
	}
	
	return 0;
}