import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
h,w = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
print('?',1,1,flush=True)
d1 = int(input())
print('?',1,w,flush=True)
d2 = int(input())
y = -1
for i in range(1,w+1):
    if (1 - i)**2 - (w - i)**2 == d1 - d2:
        y = i
        break

print('?',h,1,flush=True)
d3 = int(input())
x = -1
for i in range(1,h+1):
    if (1 - i)**2 - (h - i)**2 == d1 - d3:
        x = i
        break
print('!',x,y,flush=True)