#include <chrono>
#include <random>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#define LL long long
#define Conn(x,y) (x##y)
#define Tostring(x) (#x)
using namespace std;
bool ifnum(char x){return x>='0'&&x<='9';}
bool ifupchr(char x){return x>='A'&&x<='Z';}
bool iflochr(char x){return x>='a'&&x<='z';}
struct Rin
{
    char c;
    char gc()
    {
        return getchar();
    }
    Rin&operator >>(int &x)
    {
        bool tag=false;x=0;
        for(c=gc();c>'9'||c<'0';c=gc())if(c=='-'){c=gc();tag=true;break;}
        for(;c>='0'&&c<='9';c=gc())x=(x<<1)+(x<<3)+(c^'0');if(tag)x=-x;return *this;
    }
    Rin&operator >>(LL &x)
    {
        bool tag=false;x=0;
        for(c=gc();c>'9'||c<'0';c=gc())if(c=='-'){c=gc();tag=true;break;}
        for(;c>='0'&&c<='9';c=gc())x=(x<<1)+(x<<3)+(c^'0');if(tag)x=-x;return *this;
    }
    Rin&operator >>(char &x)
    {
        for(c=gc();!ifnum(c)&&!iflochr(c)&&!ifupchr(c);c=gc());
        x=c;
        return *this;
    }
    Rin&operator >>(string &x)
    {
        x.clear();
        for(c=gc();!ifnum(c)&&!iflochr(c)&&!ifupchr(c);c=gc());
        for(;ifnum(c)||iflochr(c)||ifupchr(c);c=gc())x.push_back(c);
        return *this;
    }
}rin;
#define rin(x) rin>>x
void jh(int &x,int &y){if(x^y)x^=y^=x^=y;return;}
void jh(LL &x,LL &y){if(x^y)x^=y^=x^=y;return;}
int min(int x,int y){return x<y?x:y;}
int max(int x,int y){return x>y?x:y;}
LL min(LL x,LL y){return x<y?x:y;}
LL max(LL x,LL y){return x>y?x:y;}

const int M=998244353;
#define lmod(i) if(i<0)i+=M
#define rmod(i) if(i>=M)i-=M
int ksm(int x,int y){int ans=1;for(;y;y>>=1){if(y&1)ans=1LL*ans*x%M;x=1LL*x*x%M;}return ans;}
void ad(int &x,int y){x+=y;rmod(x);return;}
void ac(int &x,int y){x-=y;lmod(x);return;}
int aad(int x,int y){x+=y;rmod(x);return x;}
int aac(int x,int y){x-=y;lmod(x);return x;}


#define yes {puts("YES");return;}
#define no {puts("NO");return;}

const int N=3e5+3;
int n,m;


int X,Y;
mt19937 engine(chrono::_V2::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l,r)(engine);}

int check(int x1,int y1,int x2,int y2)
{
    printf("? %d %d %d %d\n",x1,y1,x2,y2);
    int ans;cin>>ans;
    // int ans=0;
    // for(int i=x1;i<=x2;i++)for(int j=y1;j<=y2;j++)if(i==X||j==Y)ans++;
    return ans;
}
void find(int x,int y)
{
    printf("! %d %d\n",x,y);
    // if(x!=X||y!=Y)
    // {
    //     printf("n:%d m:%d X:%d Y:%d\n",n,m,X,Y);
    //     throw;
    // }
    return;
}
#define ady {if(s&2)ny2++;else ny1--;}
#define adx {if(s&1)nx2++;else nx1--;}

int cnt;
void work(int x1,int y1,int x2,int y2)
{
    if(x1==x2&&y1==y2){find(x1,y1);return;}
    if(x1==x2&&y1==y2-1)
    {
        if(x1!=1){if(check(x1-1,y1,x1,y1)==2)find(x1,y1);else find(x1,y2);}
        else {if(check(x1,y1,x1+1,y1)==2)find(x1,y1);else find(x1,y2);}
        return;
    }
    if(x1==x2-1&&y1==y2)
    {
        if(y1!=1){if(check(x1,y1-1,x1,y1)==2)find(x1,y1);else find(x2,y1);}
        else {if(check(x1,y1,x1,y1+1)==2)find(x1,y1);else find(x2,y1);}
        return;
    }
    if(x1==1&&y1==1&&x2==n&&y2==m)
    {
        int x=(x1+x2)>>1,y=(y1+y2)>>1;
        if(x-x1==y-y1)
        {
            if(x!=2)
            {
                if(n>=m)y--;
                else x--;
            }
            else
            {
                if(n>=m)x++;
                else y++;
            }
        }
        int v=check(x1,y1,x,y);
        if(v==x-x1+1)work(x+1,y1,x2,y);
        else if(v==y-y1+1)work(x1,y+1,x,y2);
        else if(v==x-x1+y-y1+1)work(x1,y1,x,y);
        else work(x+1,y+1,x2,y2);
        return;
    }
    int s=((n-x2>x1-1)?1:0)+((m-y2>y1-1)?2:0);
    int x=(x1+x2+(s&1))>>1,y=(y1+y2+((s&2)>0))>>1;
    int nx1=min(x,(s&1)?x2:x1),nx2=max(x,(s&1)?x2:x1);
    int ny1=min(y,(s&2)?y2:y1),ny2=max(y,(s&2)?y2:y1);
    // printf("%d %d %d %d\n",nx1,ny1,nx2,ny2);
    if(ny2==ny1)ady
    if(nx2==nx1)adx
    if(ny2-ny1==nx2-nx1)
    {
        // if(ny2-ny1==1)
        // {
            if((s&2)>0&&ny2<m)ny2++;
            else if(!((s&2)>0)&&ny1>1)ny1--;
            else if((s&1)>0&&nx2<n)nx2++;
            else if(!((s&1)>0)&&nx1>1)nx1--;
        // }
        // else
        // {
        //     if((s&2)>0)ny2--;
        //     else if()ny1++;
        // }
    }
    // printf("work (%d,%d)-(%d,%d) check (%d,%d)-(%d,%d)\n",x1,y1,x2,y2,nx1,ny1,nx2,ny2);
    int v=check(nx1,ny1,nx2,ny2);
    // printf("s:%d v:%d\n",s,v);
    if(v==nx2-nx1+1)
    {
        if(s&1)work(x1,max(ny1,y1),nx1-1,min(ny2,y2));
        else work(nx2+1,max(ny1,y1),x2,min(ny2,y2));
    }
    else if(v==ny2-ny1+1)
    {
        if(s&2)work(max(nx1,x1),y1,min(nx2,x2),ny1-1);
        else work(max(nx1,x1),ny2+1,min(nx2,x2),y2);
    }
    else if(v==0)
    {
        int xx1=(s&1)?x1:nx2+1,xx2=(s&1)?nx1-1:x2;
        int yy1=(s&2)?y1:ny2+1,yy2=(s&2)?ny1-1:y2;
        work(xx1,yy1,xx2,yy2);
    }
    else work(max(nx1,x1),max(ny1,y1),min(nx2,x2),min(ny2,y2));
}
void work()
{
    cin>>n>>m;
    // n=4;m=4;
    // X=rand(1,n);Y=rand(1,m);
    // X=2;Y=1;
    // if((++cnt)==53)printf("%d%d fu2ck\n",n,m);
    if(n==3&&m==3)
    {
        int s=check(1,1,3,2);
        if(s==2)for(int i=1;i<=3;i++)if(check(i,2,i,3)==2){find(i,3);return;}
        if(s==4)
        {
            s=check(1,1,2,3);
            if(s==2){work(3,1,3,2);return;}
            if(s==4)
            {
                if(check(1,2,2,2)==2){work(1,2,2,2);return;}
                else {work(1,1,2,1);return;}
            }
            return;
        }
        throw;
    }
    work(1,1,n,m);
    return;
}
int main()
{
    int T;cin>>T;
    for(;T-->0;)work();
    return 0;
}