#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
  long long ans = 1;
  while (b) {
    if (b % 2) ans = ans * a % MOD;
    a = a * a % MOD;
    b /= 2;
  }
  return ans;
}
inline void getInt(int* p);
const int maxn = 1000010;
const int inf = 0x3f3f3f3f;
int a[maxn];
int main() {
  for (int i = 1; i <= 4; i++) {
    cout << "? " << i << " " << i + 1 << endl;
    cin >> a[i];
  }
  int t[6] = {4, 8, 15, 16, 23, 42};
  do {
    int isok = 1;
    for (int i = 0; i < 4; i++) {
      if (t[i] * t[i + 1] == a[i + 1]) {
      } else {
        isok = 0;
        break;
      }
    }
    if (isok) {
      cout << "! ";
      for (int i = 0; i < 6; i++) {
        cout << t[i] << " ";
      }
      cout << endl;
      break;
    }
  } while (next_permutation(t, t + 6));
  return 0;
}
inline void getInt(int* p) {
  char ch;
  do {
    ch = getchar();
  } while (ch == ' ' || ch == '\n');
  if (ch == '-') {
    *p = -(getchar() - '0');
    while ((ch = getchar()) >= '0' && ch <= '9') {
      *p = *p * 10 - ch + '0';
    }
  } else {
    *p = ch - '0';
    while ((ch = getchar()) >= '0' && ch <= '9') {
      *p = *p * 10 + ch - '0';
    }
  }
}
