#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;
  ll sz=30;
  vector<vector<ll>>score(sz,vector<ll>(2,0));
  rep(i,0,sz){
    rep(j,0,2){
      ll now=(1<<i)*j;
      rep(k,0,n){
        ll nxt=now;
        if(s[k]=='0'&&!(a[k]&1<<i))nxt=0;
        if(s[k]=='1'&&(a[k]&1<<i))nxt=1<<i;
        score[i][j]+=abs(nxt-now);
        now=nxt;
      }
    }
  }
  while(q--){
    int t;cin>>t;
    ll ret=0;
    rep(i,0,sz){
      ret+=score[i][bool(t&1<<i)];
    }
    cout<<ret<<endl;
  }
  return 0;
}