#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 9;
const int MOD = 1e9 + 7;
long long sq(long long a) { return a * a; }
int ans[6];
bool ok = false;
int mas[] = {4, 8, 15, 16, 23, 42};
bool used[6];
vector<int> now;
void solve(int cnt) {
  if (cnt == 5) {
    for (int i = 0; i < 4; i++) {
      if (ans[i] != 0 && now[i] * now[i + 1] != ans[i]) return;
    }
    ok = true;
    int j = 0;
    for (; used[j]; ++j) {
    }
    now.push_back(mas[j]);
    cout << "! ";
    for (int i = 0; i < 6; ++i) cout << now[i] << ' ';
    exit(0);
  }
  for (int i = 0; i < 6; ++i) {
    if (!used[i]) {
      used[i] = 1;
      now.push_back(mas[i]);
      solve(cnt + 1);
      now.pop_back();
      used[i] = 0;
    }
  }
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  for (int i = 0; i < 4; i++) {
    cout << "? " << i + 1 << ' ' << i + 2 << endl;
    cin >> ans[i];
  }
  solve(0);
  return 0;
}
