#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N, Q;
int A[100000];
ll ans[2][30];
string S;

void input(){
    cin >> N >> Q;
    for(int i = 0; i < N; i++) cin >> A[i];
    cin >> S;
}

void calc(){
    // 1
    int m = (1<<30)-1;
    for(int i = 0; i < N; i++){
        int n = m;
        if(S[i] == '0'){
            n &= A[i];
        }else{
            n |= A[i];
        }
        for(int j = 0; j < 30; j++){
            ans[1][j] += abs((n&(1<<j)) - (m&(1<<j)));           
        }
        m = n;
    }
    
    m = 0;
    for(int i = 0; i < N; i++){
        int n = m;
        if(S[i] == '0'){
            n &= A[i];
        }else{
            n |= A[i];
        }
        for(int j = 0; j < 30; j++){
            ans[0][j] += abs((n&(1<<j)) - (m&(1<<j)));           
        }
        m = n;
    }
}

void solve(){
    int t; cin >> t;
    int ret = 0;
    
    for(int i = 0; i < 30; i++){
        if(t&(1<<i)){
            ret += ans[1][i];
        }else{
            ret += ans[0][i];
        }
    }
    cout << ret << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    input();
    calc();
    for(int i = 0; i < Q; i++) solve();
}