#include <bits/stdc++.h>
using namespace std;
int n, m;
const int max_n = 1000000;
int counter[max_n + 1];
bool is_full(int base, int bits_left) {
  int a = base << bits_left;
  int b = a + (1 << bits_left) - 1;
  return counter[b] - (a == 0 ? 0 : counter[a - 1]) == b - a + 1;
}
bool is_less(int a, int x) {
  int my_number = 0;
  for (int i = 20; i >= 0; --i) {
    bool bit_a = a & (1 << i);
    bool bit_x = x & (1 << i);
    my_number <<= 1;
    if (bit_a == 1) {
      int temp = my_number;
      temp += !(bit_a ^ bit_x);
      if (!is_full(temp, i)) {
        return true;
      }
    }
    my_number += (bit_a ^ bit_x);
  }
  if (!is_full(my_number, 0)) {
    return true;
  }
  return false;
}
int query(int x) {
  int a = 0;
  int b = max_n + 1;
  while (b - a > 1) {
    int mid = (a + b) / 2;
    if (is_less(mid, x)) {
      b = mid;
    } else {
      a = mid;
    }
  }
  if (is_less(a, x)) return a;
  return b;
}
void read() {
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    counter[a] = 1;
  }
  for (int i = 1; i <= max_n; ++i) {
    counter[i] += counter[i - 1];
  }
  int x_temp = 0;
  for (int i = 0; i < m; ++i) {
    int x;
    cin >> x;
    x_temp ^= x;
    cout << query(x_temp) << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  read();
  return 0;
}
