#include<bits/stdc++.h>
using namespace std;

#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define rep(i,n,m) for(int i = (n); i < (int)(m); i++)
#define rrep(i,n,m) for(int i = (m) - 1; i >= (int)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const int INF = (int)1e9+1;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
template<typename T>
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};

int main(){
  int n,q;cin>>n>>q;
  vector<int>a(n);
  rep(i,0,n)cin>>a[i];
  string s;cin>>s;
  auto f=[&](int x,int idx){
    pair<int,int> p;
    if(s[idx]=='0')p.first=x&a[idx];
    else p.first=x|a[idx];
    p.second=abs(p.first-x);
    return p;
  };
  ll res=0;
  vector<int>val(n+1);
  map<int,vector<int>>idx;
  int tmp=(1<<30)-1,change=(1<<30)-1;
  rep(i,0,n){
    auto p=f(val[i],i);
    val[i+1]=p.first;
    tmp=f(tmp,i).first;
    if(tmp^change^val[i+1]){
      ll k=tmp^change^val[i+1];
      rep(j,0,30){
        if(k&1<<j){
          idx[i].push_back(j);
          change^=1<<j;
        }
      }
    }
    else res+=p.second;
  }
  while(q--){
    int t;cin>>t;
    ll score=res;
    for(auto &v:idx){
      score+=f(t|val[v.first],v.first).second;
      for(auto z:v.second){
        t&=~(1<<z);
      }
    }
    cout<<score<<endl;
  }
  return 0;
}