#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline", "unroll-loops")
using namespace std;
#define fi first
#define se second
#define mkp make_pair
typedef pair<int,int> P;
typedef long long ll;
const int N = 15;
int T, n, m, x, y, askCnt;

bool rev;
int dp[17][17][17][17][17][17];
tuple<int,int,int,int> jc[17][17][17][17][17][17];
inline int ask(int l1, int r1, int l2, int r2) {
	if(rev) swap(l1,l2), swap(r1,r2);
#ifdef LOCAL
	++askCnt;
	int res = 0;
	for (int i = l1; i <= r1; ++i) {
		for (int j = l2; j <= r2; ++j) {
			if (x == i || y == j) {
				++res;
			}
		}
	}
	// cout<<"val = "<<res<<endl;
	return res;
#else
	cout << "? " << l1 << " " << l2 << " " << r1 << " " << r2 << endl;
	int res;
	cin >> res;
	return res;
#endif
}

inline void print_ans(int ansX, int ansY) {
	if(rev) swap(ansX, ansY);
#ifndef LOCAL
	cout << "! " << ansX << " " << ansY << endl;
#else
	assert(ansX == x && ansY == y && askCnt <= 4);
#endif
}

mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll rng(ll x,ll y){ return x+rnd()%(y-x+1); }
inline void init() {
	askCnt = 0;
	n = rng(3, 15), m = rng(3, 15);
	x = rng(1, n), y = rng(1, m);
	// n = 6, m = 7, x = 1, y = 3;
	// n = 3, m = 3, x = 2, y = 2;
}

inline P operator| (P A, P B){
	if(A.fi > A.se) return B;
	if(B.fi > B.se) return A;
	return {min(A.fi,B.fi), max(A.se,B.se)};
}
inline P operator& (P A, P B){
	return {max(A.fi,B.fi), min(A.se,B.se)};
}
inline tuple<int,int,int,int> songke(int l1,int r1,int l2,int r2,int x1,int y1,int x2,int y2,int val){
	int X = y1-x1+1, Y = y2-x2+1;
	bool s1 = (x1==y1), s2 = (x2==y2);
	P m1 = {l1, r1}, m2 = {l2, r2};

	if((!s1 && !s2) || (s1 && val != Y) || (s2 && val != X)){
		bool f1 = (val==Y || val==X+Y-1), f2 = (val==X || val==X+Y-1);
		if(f1) m1 = m1 & mkp(x1, y1);
		else{
			m1 = m1 & (mkp(l1, x1-1) | mkp(y1+1, r1));
		}
		if(f2) m2 = m2 & mkp(x2, y2); else m2 = m2 & (mkp(l2, x2-1) | mkp(y2+1, r2));
	}else if(s1 && val == Y) m1 = m1 & mkp(x1, y1);
	else m2 = m2 & mkp(x2, y2);
	return {m1.fi, m1.se, m2.fi, m2.se};
}
inline void solve() {
#ifdef LOCAL
	init();
	// cout<<"Q "<<n<<" "<<m<<" "<<x<<" "<<y<<endl;
#else
	cin >> n >> m;
#endif

	if(n > m) swap(n, m), rev = 1; else rev = 0;
	int l1=1, r1=n, l2=1, r2=m;
	int C = 0;
	while(r1>l1 || r2>l2){
		auto [x1,y1,x2,y2] = jc[n][m][l1][r1][l2][r2];
		int ret = ask(x1, y1, x2, y2);
		auto [a,b,c,d] = songke(l1,r1,l2,r2,x1,y1,x2,y2,ret);
		l1=a,r1=b,l2=c,r2=d;
		// cout<<l1<<","<<r1<<" "<<l2<<","<<r2<<endl;
		C ++;
		if(C > 10) break;
	}
	print_ans(l1, l2);
}

void chkmin(int &a,int b){ a=min(a,b); }

inline void solve(int p,int q,int l1,int r1,int l2,int r2,int x1,int y1,int x2,int y2){
	int w = 0, X = y1-x1+1, Y = y2-x2+1;
	if(X == Y) return;
	for(int val: {0, X, Y, X+Y-1}){
		auto [a,b,c,d] = songke(l1,r1,l2,r2,x1,y1,x2,y2,val);
		w = max(w, dp[p][q][a][b][c][d] + 1);
	}
	if(dp[p][q][l1][r1][l2][r2] > w){
		dp[p][q][l1][r1][l2][r2] = w;
		jc[p][q][l1][r1][l2][r2] = {x1, y1, x2, y2};
	}
}
int main() {
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	memset(dp, 0x3f, sizeof(dp));
	for(int p=3;p<=15;p++)
		for(int q=p;q<=15;q++){
			for(int i=0;i<=p+1;i++) for(int ii=0;ii<i;ii++)
			for(int j=0;j<=q+1;j++) for(int jj=0;jj<=q+1;jj++)
				dp[p][q][i][ii][j][jj]=0;
			for(int i=0;i<=p+1;i++) for(int ii=0;ii<=p+1;ii++)
			for(int j=0;j<=q+1;j++) for(int jj=0;jj<j;jj++)
				dp[p][q][i][ii][j][jj]=0;
			for(int i=1;i<=p;i++) for(int j=1;j<=q;j++) dp[p][q][i][i][j][j] = 0;
			for(int l1=p;l1>=1;l1--) for(int r1=l1;r1<=p;r1++)
			for(int l2=q;l2>=1;l2--) for(int r2=l2;r2<=q;r2++){

				if(p<15){
					for(int x1:{1})
					for(int y1=x1;y1<=r1;y1++){
						for(int x2:{1,l2})
						for(int y2=x2;y2<=r2;y2++)
							solve(p,q,l1,r1,l2,r2,x1,y1,x2,y2);
					}

					for(int y1:{p})
					for(int x1=y1;x1>=1;x1--){
						for(int y2:{q})
						for(int x2=y2;x2>=1;x2--)
							solve(p,q,l1,r1,l2,r2,x1,y1,x2,y2);
					}
				}else{
					for(int x1=1;x1<=l1;x1++)
					for(int y1=x1;y1<=p;y1++){
						for(int x2=1;x2<=l2;x2++)
						for(int y2=x2;y2<=q;y2++)
							solve(p,q,l1,r1,l2,r2,x1,y1,x2,y2);
						for(int x2=1;x2<=q;x2++)
						for(int y2=max(x2,r2);y2<=q;y2++)
							solve(p,q,l1,r1,l2,r2,x1,y1,x2,y2);
					}

					for(int x1=1;x1<=p;x1++)
					for(int y1=max(r1,x1);y1<=p;y1++){
						for(int x2=1;x2<=l2;x2++)
						for(int y2=x2;y2<=q;y2++)
							solve(p,q,l1,r1,l2,r2,x1,y1,x2,y2);
						// for(int x2=1;x2<=q;x2++)
						// for(int y2=max(x2,r2);y2<=q;y2++)
						// 	solve(p,q,l1,r1,l2,r2,x1,y1,x2,y2);
					}
				}
			}
			// cout<<"dp "<<p<<" "<<q<<" = "<<dp[p][q][1][p][1][q]<<endl;
		}
	cerr<<"solved"<<endl;
#ifdef LOCAL
	T = 15000;
#else
	cin >> T;
#endif
	while (T--) {
		solve();
	}
	return 0;
}