#include <bits/stdc++.h>
using namespace std;
bool codejam = 0;
void solve();
int32_t main() {
  long long t = 1;
  long long tt = t;
  while (t--) {
    if (codejam) cout << "Case #" << tt - t << ": ";
    solve();
  }
  return 0;
}
map<long long, long long> cnt1, cnt2;
map<pair<long long, long long>, long long> cnt;
long long fac[(long long)3e5 + 55];
long long ifac[(long long)3e5 + 55];
vector<pair<long long, long long>> vals;
const long long M = 998244353;
long long exp(long long a, long long b) {
  if (b == 0) return 1;
  long long ans = exp(a, b / 2);
  ans = (ans * ans) % M;
  if (b & 1) ans = (ans * a) % M;
  return ans;
}
void solve() {
  vector<long long> q1;
  for (long long i = 0; i < min(100, (1 << 7)); i += 1) {
    q1.push_back(i);
  }
  cout << "? ";
  for (auto i : q1) cout << i << ' ';
  cout << endl;
  long long ans = 0;
  long long v;
  cin >> v;
  for (long long i = 13; i >= 7; --i) {
    if (v & (1 << i)) ans += (1 << i);
  }
  vector<long long> q2;
  for (long long i = 1; i < (1 << 14); i += 1) {
    bool bad = false;
    for (long long j = 0; j < 7; j += 1) {
      if ((1 << j) & i) bad = true;
    }
    if (bad) continue;
    q2.push_back(i);
    if ((long long)q2.size() == 100) break;
  }
  cout << "? ";
  for (auto i : q2) cout << i << ' ';
  cout << endl;
  cin >> v;
  for (long long i = 0; i < 7; i += 1) {
    if ((1 << i) & v) ans += (1 << i);
  }
  cout << "! " << ans << endl;
}
