#include <bits/stdc++.h>
using namespace std;
pair<pair<int, int>, int> num[30];
pair<int, int> common;
int ara[7] = {4, 8, 15, 16, 23, 42}, k;
vector<int> ans;
pair<int, int> find_com(int ab) {
  int i;
  for (i = 0; i < k; i++) {
    if (num[i].second == ab) {
      return pair<int, int>(num[i].first.first, num[i].first.second);
    }
  }
}
int main() {
  int ab, bc, de, ef, i, j, cm, cm1, cm2;
  k = 0;
  for (i = 0; i < 6; i++) {
    for (j = i; j < 6; j++, k++) {
      num[k].first.first = ara[i];
      num[k].first.second = ara[j];
      num[k].second = ara[i] * ara[j];
    }
  }
  cout << "? 1 2" << endl;
  cin >> ab;
  common = find_com(ab);
  cm = common.first;
  cm1 = common.second;
  cout << "? 2 3" << endl;
  cin >> bc;
  common = find_com(bc);
  if (cm != common.first && cm1 != common.first) {
    if (cm == common.second) swap(cm, cm1);
    cm2 = common.first;
  } else {
    if (cm == common.first) swap(cm, cm1);
    cm2 = common.second;
  }
  ans.push_back(cm);
  ans.push_back(cm1);
  ans.push_back(cm2);
  cout << "? 4 5" << endl;
  cin >> de;
  common = find_com(de);
  cm = common.first;
  cm1 = common.second;
  cout << "? 5 6" << endl;
  cin >> ef;
  common = find_com(ef);
  if (cm != common.first && cm1 != common.first) {
    if (cm == common.second) swap(cm, cm1);
    cm2 = common.first;
  } else {
    cm2 = common.second;
    if (cm == common.first) swap(cm, cm1);
  }
  ans.push_back(cm);
  ans.push_back(cm1);
  ans.push_back(cm2);
  cout << "!";
  for (i = 0; i < ans.size(); i++) {
    cout << " " << ans[i];
  }
  cout << endl;
  return 0;
}
