#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

int n,q;
int a[100010];
string S;
int dp[100010][31];
int ss[31];

void solve(){
    cin >> n >> q;
    rep(i,n){
        cin >> a[i];
    }
    cin >> S;
    ll def=0;
    rep(j,31) {
        dp[0][j]=-1;
        ss[j]=-1;
    }
    rep(i,n){
        rep(j,31){
            if(S[i]=='0' && !(a[i]&(1 << j))){
                dp[i+1][j]=0;
                if(dp[i][j]==-1) ss[j]=0;
                if(dp[i][j]==1) def+=(1 << j);
            }
            else if(S[i]=='1' && (a[i]&(1 << j))){
                dp[i+1][j]=1;
                if(dp[i][j]==-1) ss[j]=1;
                if(dp[i][j]==0) def+=(1 << j);
            }
            else dp[i+1][j]=dp[i][j];
        }
    }
    rep(i,q){
        int t;cin >> t;
        ll ans=def;
        per(i,31){
            if(t&(1 << i)){
                if(ss[i]==0){
                    ans+=(1 << i);
                }
            }
            if(!(t&(1 << i))){
                if(ss[i]==1){
                    ans+=(1 << i);
                }
            }
        }
        cout << ans << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}