#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<long long int, long long int> &p1,
                  const pair<long long int, long long int> &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 5e5 + 5, inf = 4e18;
struct node {
  int next[2], cnt;
  node() {
    next[0] = -1;
    next[1] = -1;
    cnt = 0;
  }
};
std::vector<node> tri(1);
void add(int x, int p, int now) {
  if (p == -1) {
    tri[now].cnt = 1;
    return;
  }
  int nxt = ((x >> p) & 1);
  if (tri[now].next[nxt] == -1) {
    tri[now].next[nxt] = tri.size();
    tri.emplace_back();
  }
  add(x, p - 1, tri[now].next[nxt]);
  tri[now].cnt = 0;
  if (tri[now].next[0] != -1) {
    tri[now].cnt += tri[tri[now].next[0]].cnt;
  }
  if (tri[now].next[1] != -1) {
    tri[now].cnt += tri[tri[now].next[1]].cnt;
  }
}
int ans = 0;
void dfs(int x) {
  int now = 0;
  for (int p = 29; p >= 0; p--) {
    int nxt = (x >> p) & 1;
    if (tri[tri[now].next[nxt]].cnt == (1 << p)) {
      ans |= (1 << p);
      now = tri[now].next[nxt ^ 1];
    } else {
      now = tri[now].next[nxt];
    }
    if (now == -1) return;
  }
}
bool have[N];
void solve() {
  int x, n, m;
  cin >> n >> m;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> x;
    if (have[x]) continue;
    have[x] = 1;
    add(x, 29, 0);
  }
  int p = 0;
  for (long long int i = (long long int)0; i < (long long int)(m); i++) {
    cin >> x;
    p ^= x;
    ans = 0;
    if (!have[p]) {
      cout << 0 << '\n';
      continue;
    }
    dfs(p);
    cout << ans << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
