#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,Q;
  cin>>N>>Q;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];
  string S;
  cin>>S;
  vector<ll> T(Q);
  rep(i,Q) cin>>T[i];

  vector<vector<ll>> score(31,vector<ll> (2,0));
  for(int k=0;k<=30;k++){
    for(int st=0;st<2;st++){
      int now=st;
      for(int i=0;i<N;i++){
        int f=0;
        if((1<<k)&A[i]) f=1;
        if(now==f) continue;

        if(S[i]=='0'){
          if(now==1){
            score[k][st]+=(1<<k);
            now=0;
          }
        }else{
          if(now==0){
            score[k][st]+=(1<<k);
            now=1;
          }
        }
      }
    }
  }

  rep(q,Q){
    ll ans=0;
    rep(k,31){
      if(T[q]&(1<<k)) ans+=score[k][1];
      else ans+=score[k][0];
    }
    cout<<ans<<"\n";
  }

  return 0;
}