#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  std::cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
std::mt19937_64 rng(
    std::chrono::steady_clock::now().time_since_epoch().count());
const int fx[] = {+1, -1, +0, +0};
const int fy[] = {+0, +0, +1, -1};
long long int ans = 0;
long long int power(long long int a, long long int b) {
  if (b == 0) {
    return 1;
  } else if (b % 2 == 0) {
    return power(a * a, b / 2);
  } else {
    return a * power(a * a, (b - 1) / 2);
  }
}
void nishantwrp(long long int cas) {
  cout << "? ";
  long long int i = 1;
  while (i <= 100) {
    cout << i << " ";
    i++;
  }
  cout << '\n';
  fflush(stdout);
  long long int num1;
  cin >> num1;
  vector<long long int> bits(16, 0);
  for (long long int i = 0; i < 7; i++) {
    num1 /= 2;
  }
  i = 8;
  while (i <= 14) {
    bits[i - 1] = num1 % 2;
    num1 /= 2;
    i++;
  }
  cout << "? ";
  i = 1;
  while (i <= 100) {
    cout << i * power(2, 7) << " ";
    i++;
  }
  cout << '\n';
  fflush(stdout);
  long long int num2;
  cin >> num2;
  i = 1;
  while (i <= 7) {
    bits[i - 1] = num2 % 2;
    num2 /= 2;
    i++;
  }
  cout << "! ";
  for (long long int i = 0; i < (long long int)bits.size(); i++) {
    ans += bits[i] * power(2, i);
  }
  cout << ans << '\n';
  fflush(stdout);
}
signed main() {
  long long int t = 1;
  long long int cas = 1;
  while (cas <= t) {
    nishantwrp(cas);
    ans = 0;
    cas++;
  }
  return 0;
}
