package chelper;

import io.InputReader;
import io.OutputWriter;

public class E {
  public void solve(int testNumber, InputReader in, OutputWriter out) {
    long n = in.nextLong();
    long m = in.nextLong();

    out.println("? 0 0");
    out.flush();

    long dist1 = in.nextLong();

    long dist2 = n + m - dist1;

    if (dist1 <= dist2) {
      out.println("? " + dist1 + " 0");
      out.flush();

      long dist3 = in.nextLong() / 2;
      long x = dist1 - dist3;
      long y = dist3;
      out.println("! " + x + " " + y);
      out.flush();
    } else {
      out.println("? " + (n - dist2) + " " + m);
      out.flush();

      long dist3 = in.nextLong() / 2;
      long x = (n - dist2) + dist3;
      long y = m - dist3;
      out.println("! " + x + " " + y);
      out.flush();
    }
  }
}