from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from heapq import heappop, heappush
import math
_int = lambda x: int(x)-1
MOD = 998244353
INF = 1<<60
Yes, No = "Yes", "No"

H, W = map(int, input().split())
if H == 1 and W == 1:
    print("! 1 1")
    exit()

S = dict()
for i in range(1000):
    S[i*i] = i

print("? 1 1")
d = int(input())
memo = [[0]*W for _ in range(H)]

def add(i, j):
    if i < 0 or H <= i or j < 0 or W <= j: return
    memo[i][j] += 1

for i in range(1000):
    num = d-i*i
    if num < i*i: break
    if num == i*i:
        add(i, i)
    elif num in S:
        j = S[num]
        add(i, j)
        add(j, i)

ans = []
for i in range(H):
    for j in range(W):
        if memo[i][j] == 1:
            ans.append((i+1, j+1))
if len(ans) == 1:
    print(f"! {ans[0][0]} {ans[0][1]}")
    exit()

print(f"? {H} {W}")
d = int(input())
for i in range(1000):
    num = d-i*i
    if num < i*i: break
    if num == i*i:
        add(H-i-1, W-i-1)
    elif num in S:
        j = S[num]
        add(H-i-1, W-j-1)
        add(H-j-1, W-i-1)

ans = []
for i in range(H):
    for j in range(W):
        if memo[i][j] == 2:
            ans.append((i+1, j+1))
if len(ans) == 1:
    print(f"! {ans[0][0]} {ans[0][1]}")
    exit()

print(f"? 1 {W}")
d = int(input())
for i in range(1000):
    num = d-i*i
    if num < i*i: break
    if num == i*i:
        add(i, W-i-1)
    elif num in S:
        j = S[num]
        add(i, W-j-1)
        add(j, W-i-1)

ans = []
for i in range(H):
    for j in range(W):
        if memo[i][j] == 3:
            ans.append((i+1, j+1))
if len(ans) == 1:
    print(f"! {ans[0][0]} {ans[0][1]}")
    exit()