#include <bits/stdc++.h>
using namespace std;
char s[35];
class Tree {
 public:
  Tree *next[3];
  long long num;
  int temp;
  Tree() : num(0), temp(0) {
    for (int i = 0; i < 3; ++i) {
      next[i] = NULL;
    }
  };
};
void insert(Tree *root, long long s) {
  Tree *now = root;
  long long id;
  for (int i = 30; i >= 0; --i) {
    id = (s >> i) & 1;
    if (now->next[id] == NULL) {
      now->next[id] = new Tree();
    }
    now = now->next[id];
    now->num++;
  }
}
char d[35];
void pushdown(Tree *now, long long d) {
  if (d ^ now->temp) {
    now->temp = !now->temp;
    swap(now->next[0], now->next[1]);
  }
}
long long search(Tree *root, long long c) {
  Tree *now = root;
  long long ans = 0;
  for (int i = 30; i >= 0; --i) {
    pushdown(now, (c >> i) & 1);
    if (now->next[0] != NULL && now->next[0]->num != (1 << i)) {
      now = now->next[0];
    } else {
      if (now->next[0] != NULL)
        ans += (1 << i);
      else
        break;
      if (now->next[1] == NULL) break;
      now = now->next[1];
    }
  }
  return ans;
}
int n, m;
bool vis[300010];
int main() {
  int T = 1;
  while (T--) {
    memset(vis, 0, sizeof(vis));
    scanf("%d%d", &n, &m);
    Tree *root = new Tree();
    for (int i = 0; i < n; i++) {
      long long u;
      scanf("%lld", &u);
      vis[u] = true;
    }
    for (int i = 0; i < 300010; i++) {
      if (vis[i]) insert(root, i);
    }
    long long t = -1;
    while (m--) {
      long long u;
      scanf("%lld", &u);
      if (t == -1) {
        t = u;
        printf("%lld\n", search(root, t));
      } else {
        t ^= u;
        printf("%lld\n", search(root, t));
      }
    }
  }
  return 0;
}
