#include using namespace std; #define INF_LL (int64)1e18 #define INF (int32)1e9 #define REP(i, n) for(int64 i = 0;i < (n);i++) #define FOR(i, a, b) for(int64 i = (a);i < (b);i++) #define all(x) x.begin(),x.end() #define fs first #define sc second using int32 = int_fast32_t; using uint32 = uint_fast32_t; using int64 = int_fast64_t; using uint64 = uint_fast64_t; using PII = pair; using PLL = pair; const double eps = 1e-10; templateinline void chmin(A &a, B b){if(a > b) a = b;} templateinline void chmax(A &a, B b){if(a < b) a = b;} template vector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value!=0>::type fill_v(U &u,const V... v){u=U(v...);} template typename enable_if::value==0>::type fill_v(U &u,const V... v){ for(auto &e:u) fill_v(e,v...); } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int64 N, Q; cin >> N >> Q; vector A(N); REP(i, N) cin >> A[i]; string S; cin >> S; auto p = make_v(32, 2); REP(i, 32) { REP(j, 2) { int64 b = j; int64 score = 0; REP(k, N) { int64 pb = b; if (S[k] == '0') { b = b & (A[k] >> i & 1); } else { b = b | (A[k] >> i & 1); } score += (pb ^ b) << i; } p[i][j] = score; } } REP(i, Q) { int64 t; cin >> t; int64 res = 0; REP(j, 32) { res += p[j][t >> j & 1]; } cout << res << endl; } }