#include <bits/stdc++.h>
using namespace std;
const int maxn = (1 << 20);
int n, m;
int x;
int value[2 * maxn + 10];
int sz[2 * maxn + 10];
int l(int i) { return 2 * i; }
int r(int i) { return 2 * i + 1; }
int MASK[20];
void in(int x) {
  int p = 1;
  for (int j = 18; j >= 0; j--) {
    if ((1 << j) & x)
      p = r(p);
    else
      p = l(p);
  }
  value[p] = 1;
}
void init() {
  int cnt = 1 << 19;
  for (int i = (1 << 19); cnt >= 0; i++) {
    sz[i] = 1;
    value[i] = 0;
    cnt--;
  }
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> x;
    in(x);
  }
  for (int i = (1 << 19) - 1; i >= 1; i--) {
    sz[i] = sz[l(i)] + sz[r(i)];
    value[i] = value[l(i)] + value[r(i)];
  }
  for (int j = 19; j >= 0; j--) MASK[j] = 0;
}
void solve(int x) {
  for (int j = 19; j >= 0; j--) {
    if ((1 << j) & x) {
      MASK[j] ^= 1;
    }
  }
  int p = 1;
  int ans = 0;
  for (int j = 18; j >= 0; j--) {
    int lf = l(p);
    int rt = r(p);
    if (MASK[j]) {
      swap(lf, rt);
    }
    if (value[lf] == sz[lf]) {
      if (MASK[j]) ans -= sz[lf];
      p = rt;
    } else {
      if (MASK[j]) ans += sz[rt];
      p = lf;
    }
  }
  cout << p - (1 << 19) - ans << endl;
}
int main() {
  init();
  for (int i = 0; i < m; i++) {
    int xx;
    cin >> xx;
    solve(xx);
  }
  return 0;
}
