#include #define rep(i,n) for(int i=0;i<(int)(n);i++) #define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++) #define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++) #define setp(n) fixed << setprecision(n) template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } #define ll long long #define vll vector #define vi vector #define pll pair #define pi pair #define all(a) (a.begin()),(a.end()) #define rall(a) (a.rbegin()),(a.rend()) #define fi first #define se second #define pb push_back #define ins insert #define debug(a) cerr<<(a)< ostream &operator<<(ostream &os, const pair &p){return os<<"("< istream &operator>>(istream &is, pair &p){return is>>p.fi>>p.se;} /* Some Libraries */ //------------------------------------------------- ll calc[30][2]; int main(void) { cin.tie(0); ios::sync_with_stdio(false); int N,Q; cin>>N>>Q; vi a(N); rep(i,N) cin>>a[i]; string S; cin>>S; rep(i,30){ ll m=1<>i&1; if (S[k]=='0'){ if (cur==1 && b==0){ cur=0; sum+=m; } }else{ if (cur==0 && b==1){ cur=1; sum+=m; } } } calc[i][j]=sum; } } while(Q--){ int t; cin>>t; ll ans=0; rep(i,30){ ans+=calc[i][t>>i&1]; } cout<