#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


signed main(){
    int n,q;cin>>n>>q;

    vector<ll> a(n);
    cin>>a;
    string s;cin>>s;

    ll res[40][2];

    rep(i,40)rep(j,2){
        int sum=0;
        int x=j;
        rep(k,n){
            int nx=x;
            if(s[k]=='0') nx&=((a[k]>>i)&1);
            else          nx|=((a[k]>>i)&1);  
            sum+=abs(nx-x);
            x=nx;
        }
        res[i][j]=sum;
    }

    while(q--){
        ll t;cin>>t;
        ll ans=0;
        rep(i,40) ans+=(1ll<<i)*res[i][(t>>i)&1]; 
        
        cout<<ans<<endl;
    }

    return 0;
}