#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
void solve() {
  int d = pow(2, 7);
  cout << "? ";
  for (int i = 1; i < 101; i++) cout << d * i << " ";
  cout << endl << flush;
  int v1;
  cin >> v1;
  int f1 = d ^ v1;
  long long int sum = 0;
  int co = 0, rem;
  while (f1 != 0) {
    rem = f1 % 2;
    f1 /= 2;
    if (co < 7) sum += rem * (pow(2, co));
    co++;
  }
  cout << "? ";
  for (int i = 1; i < 101; i++) cout << i << " ";
  cout << endl << flush;
  int v2;
  cin >> v2;
  int f2 = v2;
  co = 0;
  while (f2 != 0) {
    rem = f2 % 2;
    f2 /= 2;
    if (co >= 7) sum += rem * (pow(2, co));
    co++;
  }
  cout << "! " << sum << endl << flush;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
