#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a, b;
int rd(int c, int d) {
  printf("? %d %d\n", c, d);
  fflush(stdout);
  int x;
  scanf("%d", &x);
  return x;
}
void same(int pos) {
  for (int j = pos; j >= 0; j--) {
    int x = rd(a | (1 << j), 0);
    int y = rd(0, b | (1 << j));
    assert(x != y);
    assert(x == 1 || y == 1);
    if (y == 1) {
      a += 1 << j;
      b += 1 << j;
    }
  }
  printf("! %d %d\n", a, b);
  exit(0);
}
void fmain(int tid) {
  int w = rd(0, 0);
  if (w == 0) same(29);
  for (int j = 29; j >= 0; j--) {
    int x = rd(a | (1 << j), 0);
    int y = rd(0, b | (1 << j));
    if (x == 1 && y == -1) {
    } else if (x == -1 && y == 1) {
      a += 1 << j;
      b += 1 << j;
    } else {
      if (w == 1) {
        a += 1 << j;
      } else {
        assert(w == -1);
        b += 1 << j;
      }
      if (x == 0)
        same(j - 1);
      else
        w = x;
    }
  }
  printf("! %d %d\n", a, b);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
