#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <bitset>
#include <vector>
#include <random>
#include <cassert>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <unordered_map>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define per(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << " \n"[_ == r]

const int N = 4e5 + 10;
const int L = 30;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + (c - 48);
  return x * f;
}

int n, tc, o[N], a[N], id[N];

int ask(int i) {
  cout << "? " << i << endl;
  cout.flush();
  int res;
  cin >> res;
  return res;
}

void answer(int x) {
  cout << "! " << x << endl;
  cout.flush();
  return;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n >> tc;
  rep(i, 1, n) cin >> o[i], id[i] = i;
  while (tc--) {
    int x = 0;
    rep(d, 0, L - 1) {
      // pv(d);
      rep(i, 1, n) a[i] = o[i] ^ x;
      sort(id + 1, id + n + 1, [&](int i, int j) {
        return a[i] < a[j];
      });
      rep(i, 1, n - 1) {
        if (((a[id[i + 1]] ^ a[id[i]]) >> d) != 1) continue;
        if (ask(id[i]) != id[i + 1]) x |= 1 << d;
        break;
      }
    }
    answer(x);
  }
  return 0;
}