Problem: This is an interactive problem. Remember to flush your output while communicating with the testing program. You may use fflush(stdout) in C++, system.out.flush() in Java, stdout.flush() in Python or flush(output) in Pascal to flush the output. If you use some other programming language, consult its documentation. You may also refer to the guide on interactive problems: <https://codeforces.com/blog/entry/45307>.

The jury guessed some array a consisting of 6 integers. There are 6 special numbers — 4, 8, 15, 16, 23, 42 — and each of these numbers occurs in a exactly once (so, a is some permutation of these numbers).

You don't know anything about their order, but you are allowed to ask up to 4 queries. In each query, you may choose two indices i and j (1 ≤ i, j ≤ 6, i and j are not necessarily distinct), and you will get the value of a_i ⋅ a_j in return.

Can you guess the array a?

The array a is fixed beforehand in each test, the interaction program doesn't try to adapt to your queries.

Interaction

Before submitting the answer, you may ask up to 4 queries. To ask a query, print one line in the following format: ? i j, where i and j should be two integers such that 1 ≤ i, j ≤ 6. The line should be ended with a line break character. After submitting a query, flush the output and read the answer to your query — one line containing one integer a_i ⋅ a_j. If you submit an incorrect query (or ask more than 4 queries), the answer to it will be one string 0. After receiving such an answer, your program should terminate immediately — otherwise you may receive verdict "Runtime error", "Time limit exceeded" or some other verdict instead of "Wrong answer".

To give the answer, your program should print one line ! a_1 a_2 a_3 a_4 a_5 a_6 with a line break in the end. After that, it should flush the output and terminate gracefully.

Example

Input


16
64
345
672

Output


? 1 1
? 2 2
? 3 5
? 4 6
! 4 8 15 16 23 42

Note

If you want to submit a hack for this problem, your test should contain exactly six space-separated integers a_1, a_2, ..., a_6. Each of 6 special numbers should occur exactly once in the test. The test should be ended with a line break character.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
inline void boostIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(10);
}
inline long long safe_mul(long long x, long long y, long long mod) {
  return x * 1LL * y % mod;
}
inline void safe_add(long long& x, long long y, long long mod) {
  x += y;
  if (x >= mod) x -= mod;
}
const long long INF = 1e16;
const long long modulo = 1e9 + 7;
const long double EPS = 1e-6;
const long double pi = 3.14159265358979323846;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long optpow(long long a, long long b, long long k) {
  if (b == 0) return 1;
  long long tmp = optpow(a, b / 2, k);
  if (b % 2 == 1) {
    return ((tmp * tmp) % k * a) % k;
  } else {
    return (tmp * tmp) % k;
  }
}
long long qckpow(long long a, long long b) {
  if (b == 0) return 1;
  long long tmp = qckpow(a, b / 2);
  if (b % 2 == 1) {
    return ((tmp * tmp) * a);
  } else {
    return (tmp * tmp);
  }
}
bool comp(pair<long long, long long> p1, pair<long long, long long> p2) {
  if (p1.second == p2.second) return p1.first < p2.first;
  return p1.second < p2.second;
}
struct pt {
  long double x, y;
  pt(long double x1 = 0, long double y1 = 0) {
    x = x1;
    y = y1;
  }
  void write() { cout << x << " " << y << endl; }
};
pt operator+(pt a, pt b) { return pt(a.x + b.x, a.y + b.y); }
pt operator-(pt a, pt b) { return pt(a.x - b.x, a.y - b.y); }
long double dist1(pt a) { return sqrt(a.x * a.x + a.y * a.y); }
long double dist2(pt a) { return (a.x * a.x + a.y * a.y); }
long double vmult(pt a, pt b) { return (a.x * b.y - a.y * b.x); }
long double smult(pt a, pt b) { return (a.x * b.x + a.y * b.y); }
long double cosa(pt a, pt b) { return smult(a, b) / (dist1(a) * dist1(b)); }
struct line {
  long double a, b, c, d;
  line() {}
  line(pt p1, pt p2) {
    a = p2.y - p1.y;
    b = p1.x - p2.x;
    c = p1.y * (p2.x - p1.x) - p1.x * (p2.y - p1.y);
  }
};
long double R(line L, pt p) {
  return fabs((L.a * p.x + L.b * p.y + L.c) / (sqrt(L.a * L.a + L.b * L.b)));
}
bool E(line L, pt p) {
  if (fabs(L.a * p.x + L.b * p.y + L.c) < EPS) return true;
  return false;
}
pt line_inter(line l1, line l2) {
  pt ans;
  ans.x =
      (long double)(l2.b * l1.c - l1.b * l2.c) / (l1.b * l2.a - l1.a * l2.b);
  ans.y =
      (long double)(l2.a * l1.c - l1.a * l2.c) / (l1.a * l2.b - l2.a * l1.b);
  return ans;
}
long long sgn(pt v1, pt v2) {
  long double ans = smult(v1, v2);
  if (abs(ans) <= EPS) return 0;
  if (ans > EPS) return 1;
  return -1;
}
long long area(pt a, pt b, pt c) {
  return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
}
bool intersect(long long a, long long b, long long c, long long d) {
  if (a > b) swap(a, b);
  if (c > d) swap(c, d);
  return max(a, c) <= min(b, d);
}
bool intersection(pt a, pt b, pt c, pt d) {
  return intersect(a.x, b.x, c.x, d.x) && intersect(a.y, b.y, c.y, d.y) &&
         area(a, b, c) * area(a, b, d) <= 0 &&
         area(c, d, a) * area(c, d, b) <= 0;
}
pt rotate(pt p, long double a) {
  pt p1;
  p1.x = p.x * cos(a) - p.y * sin(a);
  p1.y = p.x * sin(a) + p.y * cos(a);
  return p1;
}
int32_t main() {
  boostIO();
  const long long c = 64, n = 100;
  bitset<c> b;
  bitset<14> b1;
  vector<long long> q1(n), q2(n);
  for (long long i = 16256, k = 0; i < 16356; ++i, ++k) {
    q1[k] = i;
    b = i;
    for (long long j = 13; j >= 0; --j) {
      b1[j] = b[13 - j];
    }
    long long temp = 0;
    for (long long j = 0; j < (14); j++) {
      if (b1[j] == 1) temp += (1 << j);
    }
    q2[k] = temp;
  }
  sort(q2.begin(), q2.end());
  cout << "? ";
  for (long long i = 0; i < (n); i++) {
    cout << q1[i] << " ";
  }
  cout << endl;
  long long a;
  cin >> a;
  b = a;
  bitset<14> answ;
  for (long long i = 13; i >= 7; --i) {
    if (b[i] == 0) {
      answ[i] = 1;
    }
  }
  cout << "? ";
  for (long long i = 0; i < (n); i++) {
    cout << q2[i] << " ";
  }
  cout << endl;
  cin >> a;
  b = a;
  for (long long i = 6; i >= 0; --i) {
    if (b[i] == 0) {
      answ[i] = 1;
    }
  }
  long long ans = 0;
  for (long long i = 0; i < (14); i++) {
    if (answ[i] == 1) ans += (1 << i);
  }
  cout << "! " << ans;
}