#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 19) + 7;
int t[N * 20][3], cnt[20], ptr = 1, v[N];
void insrt(bitset<20> b, int x) {
  int cur = 1;
  for (int i = 19; i >= 0; i--) {
    if (!t[cur][b[i]]) t[cur][b[i]] = ++ptr;
    cur = t[cur][b[i]];
    t[cur][2] += x;
  }
}
int query() {
  int ans = 0, cur = 1;
  for (int i = 19; i >= 0; i--) {
    if (!cnt[i]) {
      if (t[t[cur][0]][2] != (1 << i))
        cur = t[cur][0];
      else {
        cur = t[cur][1];
        ans |= (1 << i);
      }
    } else {
      if (t[t[cur][1]][2] != (1 << i))
        cur = t[cur][1];
      else {
        cur = t[cur][0];
        ans |= (1 << i);
      }
    }
  }
  return ans;
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    if (!v[x]) insrt(bitset<20>(x), +1);
    v[x] = 1;
  }
  for (int i = 1; i <= m; i++) {
    int x;
    cin >> x;
    for (int j = 0; j < 20; j++) {
      cnt[j] ^= ((x >> j) & 1);
    }
    cout << query() << endl;
  }
}
