#pragma clang diagnostic push
#pragma ide diagnostic ignored "cppcoreguidelines-narrowing-conversions"
#pragma ide diagnostic ignored "hicpp-signed-bitwise"
#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<pdd> vpdd;
typedef vector<vd> vvd;
#define yn(ans) printf("%s\n", (ans)?"Yes":"No");
#define YN(ans) printf("%s\n", (ans)?"YES":"NO");
template<class T> bool chmax(T &a, T b) {
	if (a >= b) return false;
	a = b; return true;
}
template<class T> bool chmin(T &a, T b) {
	if (a <= b) return false;
	a = b; return true;
}
#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t)) 
#define REP(i, e) for (int i = 0; i < (e); ++i) 
#define REP1(i, s, e) for (int i = (s); i < (e); ++i)
#define RREP(i, e) for (int i = (e); i >= 0; --i)
#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define qb pop_back
#define pf push_front
#define qf pop_front
#define maxe max_element
#define mine min_element
ll inf = 1e18;
#define DEBUG printf("%d\n", __LINE__); fflush(stdout);
template<class T> void print(vector<T> &v, bool withSize = false) {
	if (withSize) cout << v.size() << endl;
	REP(i, v.size()) cout << v[i] << " "; 
	cout << endl;
}
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

int __FAST_IO__ = []() {
	std::ios::sync_with_stdio(0);
	std::cin.tie(0);
	std::cout.tie(0);
	return 0;
}();

class Union {
public:
	Union(int _n): n(_n), tot(n), p(n, 0), c(n, 1) {REP(i, n) p[i] = i;}
	int find(int x) {return p[x] == x?x:(p[x] = find(p[x]));}
	bool merge(int x, int y) {
		int a = find(x), b = find(y);
		if (a == b) return false;
		int e = min(a, b), f = max(a, b);
		p[f] = p[e];
		c[e] += c[f];
		c[f] = 0;
		--tot;
		return true;
	}
	int ng() {return tot;}
	int count(int g) {return c[g];}
	
private:
	int n, tot;
	vector<int> p, c;
};

#define TESTS int t; cin >> t; while (t--)
#define TEST 
int main() {
    TEST {
        int H, W;
        cin >> H >> W;
        vvi v(H, vi(W, 0));
        REP(i, H) REP(j, W) cin >> v[i][j];
        
        int Q;
        cin >> Q;
        vvi q(Q);
        vi p(Q);
        REP(i, Q) {
            int r1, c1, r2, c2;
            cin >> r1 >> c1 >> r2 >> c2;
            q[i] = {--r1, --c1, --r2, --c2};
            p[i] = i;
        }
        
        vi ans(Q);
        
        auto solve = [&](auto &&self, int L, int R, vi &ask) -> void {
            if (L > R || ask.empty()) return;
            if (L == R) {
                for (auto c: ask) ans[c] = L;
                return;
            }
            
            vi l, r;
            int mid = (L + R) >> 1;
            Union u(H * W);
            REP(i, H) {
                REP(j, W) {
                    if (v[i][j] > mid) continue;
                    if (i < H - 1 && v[i + 1][j] <= mid) u.merge(i * W + j, (i + 1) * W + j);
                    if (j < W - 1 && v[i][j + 1] <= mid) u.merge(i * W + j, i * W + (j + 1));
                }
            }
            
            for (auto c: ask) {
                int r1 = q[c][0], c1 = q[c][1], r2 = q[c][2], c2 = q[c][3];
                if (u.find(r1 * W + c1) == u.find(r2 * W + c2)) l.pb(c); else r.pb(c);
            }
            self(self, L, mid, l);
            self(self, mid + 1, R, r);
        };
        solve(solve, 0, H * W, p);
    
        REP(i, Q) printf("%d\n", ans[i]);
    }
    
    
    return 0;
}