#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e5 + 10;
int n, m, tot;
int tree[22 * maxn][2];
long long val[22 * maxn];
bool vis[maxn];
void insert(long long x) {
  int root = 0;
  for (int i = 32; i >= 0; i--) {
    int c = (x >> i) & 1;
    if (!tree[root][c]) tree[root][c] = tot++;
    root = tree[root][c];
  }
  val[root] = x;
}
long long solve(long long x) {
  int root = 0;
  for (int i = 32; i >= 0; i--) {
    int c = (x >> i) & 1;
    if (tree[root][c])
      root = tree[root][c];
    else
      root = tree[root][c ^ 1];
  }
  return val[root] ^ x;
}
int main() {
  while (~scanf("%d%d", &n, &m)) {
    tot = 1;
    memset(tree, 0, sizeof(tree));
    memset(vis, 0, sizeof(vis));
    long long tmp;
    for (int i = 1; i <= n; i++) scanf("%I64d", &tmp), vis[tmp] = 1;
    for (int i = 0; i <= 6e5; i++)
      if (!vis[i]) insert((long long)i);
    tmp = 0;
    long long q = 0;
    while (m--) {
      scanf("%I64d", &q);
      tmp ^= q;
      printf("%I64d\n", solve(tmp));
    }
  }
  return 0;
}
