#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, Q;
  cin >> N >> Q;
  ll A[N];
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }
  string S;
  cin >> S;
  ll T[Q];
  for (int i = 0; i < Q; ++i) {
    cin >> T[i];
  }

  ll memo[35][2];
  memset(memo, 0, sizeof(memo));

  for (int i = 0; i < 35; ++i) {
    ll val = pow(2, i);

    for (int d = 0; d < 2; ++d) {
      ll cur = d;

      for (int idx = 0; idx < N; ++idx) {
        ll a = A[idx];
        ll b_cur = cur;
        
        if (S[idx] == '0') {
          cur &= (a >> i) & 1;
        } else {
          cur |= (a >> i) & 1;
        }

        memo[i][d] += (cur ^ b_cur) * val;
      }
    }
  }

  for (int i = 0; i < Q; ++i) {
    ll t = T[i];
    ll ans = 0;

    for (int i = 0; i < 35; ++i) {
      int d = (t >> i) & 1;
      ans += memo[i][d];
    }

    cout << ans << endl;
  }

  return 0;
}