#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, q; cin >> n >> q;
  vector<int> a(n); REP(i, n) cin >> a[i];
  string s; cin >> s;
  constexpr int X = 30;
  vector memo(X, vector(2, 0LL));
  REP(i, X) REP(j, 2) {
    int x = j;
    REP(k, n) {
      int nx = s[k] == '0' ? (x & (a[k] >> i & 1)) : (x | (a[k] >> i & 1));
      memo[i][j] += (x ^ nx) << i;
      x = nx;
    }
  }
  while (q--) {
    int t; cin >> t;
    ll ans = 0;
    REP(i, X) ans += memo[i][t >> i & 1];
    cout << ans << '\n';
  }
  return 0;
}