#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n,q;cin >> n >>q;
    vector<ll> a(n);rep(i,n)cin >> a[i];
    string s;cin >> s;
    vector<vvl> dp(n,vvl(32,vl(2,0)));
    vvl x(32,vl(2,0));
    rep(i,32)x[i][1]=1;
    rep(i,n){
        rep(j,32){
            rep(k,2){
                if(s[i]=='0'){
                    ll z=a[i]&(1LL<<j);
                    if(x[j][k]&&z==0)dp[i][j][k]=(1LL<<j),x[j][k]=0;
                }
                else{
                    ll z=a[i]&(1LL<<j);
                    if(x[j][k]==0&&z)dp[i][j][k]=z,x[j][k]=1;
                }
            }
        }
    }
    vvl ans(32,vl(2));
    rep(i,n){
        rep(j,32){
            ans[j][0]+=dp[i][j][0];
            ans[j][1]+=dp[i][j][1];
        }
    }
    while(q--){
        ll t;cin >> t;
        ll ret=0;
        rep(i,32){
            if(t&1LL<<i)ret+=ans[i][1];
            else ret+=ans[i][0];
        }
        cout << ret <<endl;
    }
}