#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q, t;
    vector<int> A(N);
    string s;
    cin >> N >> Q;
    for(int i = 0; i < N; ++i)  cin >> A[i];
    cin >> s;

    vector<vector<int>> W(30, vector<int>(2));
    for(int k = 0; k < 30; ++k){
        for(int j = 0; j < 2; ++j){
            int x = j;
            for(int i = 0; i < N; ++i){
                int nx = x;
                if(s[i] == '0') nx &= (A[i] >> k) & 1;
                else    nx |= (A[i] >> k) & 1;
                W[k][j] += abs(nx - x);
                x = nx;
            }
        }
    }

    for(int i = 0; i < Q; ++i){
        cin >> t;
        ll ans = 0;
        for(int k = 0; k < 30; ++k){
            int j = t & 1;
            ans += W[k][j] * (1LL << k);
            t >>= 1;
        }
        cout << ans << '\n';
    }

    return 0;
}