#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll INF=1e9+7;
const ll inf=INF;
const ll MOD=998244353;
const ll mod=MOD;
const int MAX=200010;

signed main(){
    ll n,q;cin>>n>>q;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    string s;cin>>s;
    vector<vector<ll> >d(33,vector<ll>(2));
    rep(i,33){
        rep(j,2){
            ll v=j*(1LL<<i);
            ll res=0;
            rep(k,n){
                if(s[k]=='0'){
                    if((v&a[k])!=v)res+=1LL<<i;
                    v&=a[k];
                }else{
                    if((v|((1LL<<i)&a[k]))!=v)res+=1LL<<i;
                    v|=((1LL<<i)&a[k]);
                }
            }
            d[i][j]=res;
        }
    }
    while(q--){
        ll t;cin>>t;
        ll ans=0;
        rep(i,33){
            ans+=d[i][((1LL<<i)&t)>0];
        }
        cout<<ans<<endl;
    }
}