#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int maxm;
int js(int x) {
  int ans = 0;
  while (x != 0) {
    x = x / 2;
    ans++;
  }
  return ans;
}
struct crenode {
  crenode *next[2];
  int cnt;
  int res;
};
struct trie {
  crenode *root;
  crenode tree[5000000];
  int tot;
  void init() {
    tot = 0;
    root = &tree[tot];
    tot++;
  }
  void insert(int c) {
    crenode *p = root;
    p->cnt++;
    for (int i = maxm - 1; i >= 0; i--) {
      int k = (1 << i) & c;
      if (k != 0) k = 1;
      if (p->next[k] == NULL) {
        p->next[k] = &tree[tot++];
      }
      p = p->next[k];
      p->cnt++;
    }
  }
  void change(crenode *p, int d) {
    for (int i = 0; i < 2; i++)
      if (p->next[i]) p->next[i]->res ^= p->res;
    if ((p->res >> d) & 1) swap(p->next[0], p->next[1]);
    p->res = 0;
  }
  int query(int c) {
    int ans = 0;
    root->res ^= c;
    crenode *p = root;
    for (int i = maxm - 1; i >= 0; i--) {
      change(p, i);
      if (p->next[0] != NULL && p->next[0]->cnt == (1 << i)) {
        ans |= (1 << i);
        if (p->next[1] == NULL) {
          p->next[1] = &tree[tot];
          tot++;
        }
        p = p->next[1];
      } else {
        if (p->next[0] == NULL) {
          p->next[0] = &tree[tot];
          tot++;
        }
        p = p->next[0];
      }
    }
    return ans;
  }
};
trie t1;
int a[maxn];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int c;
  t1.init();
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  n = unique(a + 1, a + n + 1) - a - 1;
  maxm = js(a[n]) + 1;
  for (int i = 1; i <= n; i++) {
    t1.insert(a[i]);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d", &c);
    int ans = t1.query(c);
    printf("%d\n", ans);
  }
}
