#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
void exgcd(long long a, long long b, long long &d, long long &first,
           long long &second) {
  b                          ? exgcd(b, a % b, d, second, first),
      second -= a / b *first : first = 1, second = 0, d = a;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
const int N = 1 << 19;
int n, m, tot, T;
int vis[N];
struct {
  int ch[2], sum;
} tr[N << 2];
void ins(int &o, int d, int first) {
  if (!o) o = ++tot;
  ++tr[o].sum;
  if (d >= 0) ins(tr[o].ch[first >> d & 1], d - 1, first);
}
int query(int o, int d, int first) {
  if (d < 0) return 0;
  int t = first >> d & 1;
  if (tr[tr[o].ch[t]].sum == (1 << d))
    return (1 << d) ^ query(tr[o].ch[t ^ 1], d - 1, first);
  return query(tr[o].ch[t], d - 1, first);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    int t;
    scanf("%d", &t);
    if (vis[t]) continue;
    vis[t] = 1;
    ins(T, 18, t);
  }
  int num = 0;
  for (int i = 1; i <= m; ++i) {
    int t;
    scanf("%d", &t);
    printf("%d\n", query(T, 18, num ^= t));
  }
}
