from sys import stdin,setrecursionlimit#,set_int_max_str_digits
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
setrecursionlimit(20000000) # これこどふぉだと無理
#set_int_max_str_digits(200010)

mod = 998244353  
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
inf = 10**18

h,w, = mi() 


def ans(u,v):
    print("!",u,v,flush=True)
    exit() 

def ask(u,v):
    print("?",u,v,flush=True)
    d = ii() 
    return d 

if h*w == 1:
    ans(1,1)

d1 = ask(1,1) 

# if h == 1:
#     ans(1,int(d1**0.5))
# elif w == 1:
#     ans(int(d1**0.5),1)
def dist(u,v,i,j):
    return (u-i)**2 + (v-j)**2 

cnt = 0 
for i in range(1,h+1):
    for j in range(1,w+1):
        if dist(i,j,1,1) == d1:
            cnt += 1 
            ii = i
            jj = j 

if cnt == 1:
    ans(ii,jj)


d2 = ask(1,w) 

cnt = 0 

for i in range(1,h+1):
    for j in range(1,w+1):
        if dist(i,j,1,1) == d1 and dist(i,j,1,w) == d2:
            cnt += 1 
            ii = i
            jj = j 

if cnt == 1:
    ans(ii,jj)


d3 = ask(h,w) 

cnt = 0 
for i in range(1,h+1):
    for j in range(1,w+1):
        if dist(i,j,1,1) == d1 and dist(i,j,1,w) == d2 and dist(i,j,h,w) == d3:
            cnt += 1 
            ii = i
            jj = j 

if cnt == 1:
    ans(ii,jj)

assert 0