#include <bits/stdc++.h>
using namespace std;
template <typename T>
void printvec(vector<T>& vec) {
  for (int i = 0; i < vec.size(); i++) {
    cout << vec[i] << " ";
  }
  cout << endl;
}
string converttostring(int x) {
  int i;
  string ans;
  for (i = 0; i < 20; i++) {
    ans.push_back('0' + x % 2);
    x /= 2;
  }
  reverse(ans.begin(), ans.end());
  return ans;
}
struct numbertrie {
  int size;
  struct numbertrie* arr[2];
  numbertrie() {
    size = 0;
    int i;
    for (i = 0; i < 2; i++) {
      arr[i] = NULL;
    }
  }
  void insert(string& str, int pos) {
    size++;
    if (str.length() == pos) return;
    int a = str[pos] - '0';
    if (arr[a] == NULL) {
      arr[a] = new numbertrie();
    }
    arr[a]->insert(str, pos + 1);
  }
  void query(string& str, int& ans, int pos) {
    if (str.length() == pos) return;
    int letter = str[pos] - '0';
    if (arr[letter] == NULL) {
      return;
    }
    int len = str.length();
    int req = len - pos - 1;
    req = (1 << req);
    if (arr[letter]->size != req) {
      arr[letter]->query(str, ans, pos + 1);
    } else {
      ans = ans + req;
      if (arr[1 - letter] == NULL) {
        return;
      }
      arr[1 - letter]->query(str, ans, pos + 1);
    }
  }
};
int main() {
  std::ios::sync_with_stdio(false);
  int ttt = 1;
  while (ttt--) {
    int n, m, i;
    cin >> n >> m;
    set<int> sett;
    numbertrie* trie = new numbertrie();
    for (i = 0; i < n; i++) {
      int temp;
      cin >> temp;
      if (sett.find(temp) != sett.end()) continue;
      sett.insert(temp);
      string abc = converttostring(temp);
      trie->insert(abc, 0);
    }
    int pre = 0;
    for (i = 0; i < m; i++) {
      int temp;
      cin >> temp;
      pre = (pre ^ temp);
      int ans = 0;
      string abc = converttostring(pre);
      trie->query(abc, ans, 0);
      cout << ans << endl;
    }
  }
  return 0;
}
