#include <iostream>
#include <vector>
#include <string>

using lint = long long;

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

void solve() {
    int n, q;
    std::cin >> n >> q;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;
    std::string s;
    std::cin >> s;

    auto scores = vec(30, vec(2, 0));
    for (int k = 0; k < 30; ++k) {
        for (int sb = 0; sb < 2; ++sb) {
            auto& score = scores[k][sb];
            auto b = sb;

            for (int i = 0; i < n; ++i) {
                auto pb = b;
                int c = (xs[i] >> k) & 1;

                if (s[i] == '0') {
                    b &= c;
                    score += pb - b;
                } else {
                    b |= c;
                    score += b - pb;
                }
            }
        }
    }

    while (q--) {
        int t;
        std::cin >> t;

        lint ans = 0;
        for (int k = 0; k < 30; ++k) {
            ans += scores[k][(t >> k) & 1] * (1LL << k);
        }
        std::cout << ans << "\n";
    }
}

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

    solve();

    return 0;
}