#include using namespace std; #define rep(i,a,b) for(ll i=a;i=b;i--) #define ll long long #define ull unsigned ll #define ld long double #define bl __int128_t #define fi first #define se second #define vel vector #define vvel vector #define pll pair #define vepll vector #define vvepll vector #define ves vector #define vem vector #define vvem vector #define pmm pair #define vepmm vector #define cleout(i) cout<using PQ=priority_queue,greater>; // 上 右 下 左 vector di={-1, 0, 1, 0}; vector dj={ 0, 1, 0,-1}; vector dx={ 0, 1, 0,-1}; vector dy={ 1, 0,-1, 0}; vector ddx={ 1, 1, 1, 0, -1, -1, -1, 0 }; vector ddy={ 1, 0, -1, -1, -1, 0, 1, 1 }; ll inf=1000000000000000000;//1e18 // LLONG_MAX mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count()); //[x^M]1/(1-x)^N=comb(N-1+M,M) void ask(pll &a,pll &res){ cout<>res.fi>>res.se; } void _solve(){ ll H,W; cin>>H>>W; pll now={1,1}; pll res; cin>>res.fi>>res.se; if(res.fi==H-1&&res.se==W-1){ if(res.fi-1!=1){ now.fi=res.fi-1; ask(now,res); if(res.fi==0)return ; now.se=res.se; ask(now,res); if(res.fi==0)return ; now={res.fi-1,res.se}; ask(now,res); if(res.fi==0)return ; }else{ now.se=res.se-1; ask(now,res); if(res.fi==0)return ; now.fi=res.fi; ask(now,res); if(res.fi==0)return ; now={res.fi,res.se-1}; ask(now,res); if(res.fi==0)return ; } } if(res.fi==H){ now.fi=H-1; ask(now,res); if(res.fi==0)return ; now.se=res.se; ask(now,res); if(res.fi==0)return ; } if(res.se==W){ now.se=W-1; ask(now,res); if(res.fi==0)return ; now.fi=res.fi; ask(now,res); if(res.fi==0)return ; } } int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll _; bool multitest=1; if(multitest)cin>>_; else _=1; rep(__,0,_){ _solve(); } }