#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
void solve() {
	int h, w; cin >> h >> w;
	if (h == 3 && w == 3) {
		int x, y;
		cin >> x >> y;
		cout << 2 << " " << 2 << endl;
		cin >> x >> y;
	}
	else if (h == 3) {
		int x, y;
		cin >> x >> y;
		cout << 1 << " " << w - 2 << endl;
		cin >> x >> y;
		cout << 2 << " " << w - 1 << endl;
		cin >> x >> y;
	}
	else if (w == 3) {
		int x, y;
		cin >> x >> y;
		cout << h - 2 << " " << 1 << endl;
		cin >> x >> y;
		cout << h - 1 << " " << 2 << endl;
		cin >> x >> y;
	}
	else {
		int x, y;
		cin >> x >> y;
		cout << 1 << " " << w - 2 << endl;
		cin >> x >> y;
		cout << h - 2 << " " << w - 2 << endl;
		cin >> x >> y;
		if (x == h - 3) {
			cout << h - 3 << " " << w - 1 << endl;
		}
		else {
			cout << h - 1 << " " << w - 1 << endl;
		}
		cin >> x >> y;
	}
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--)solve();
	return 0;
}