#include <bits/stdc++.h>

using namespace std;
#include <atcoder/dsu>
using namespace atcoder;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

int main() {
    fast_io();
    int h, w;
    cin >> h >> w;
    vector<vector<int>> a(h, vector<int>(w));
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            cin >> a[i][j];
        }
    }
    int q;
    cin >> q;
    vector<int> rs(q), cs(q), rt(q), ct(q);
    for (int i = 0; i < q; i++) {
        cin >> rs[i] >> cs[i] >> rt[i] >> ct[i];
        rs[i]--;
        cs[i]--;
        rt[i]--;
        ct[i]--;
    }
    vector<int> ans(q);
    map<pair<int, int>, vector<int>> mp;
    for (int i = 0; i < q; i++) {
        mp[{0, h * w}].push_back(i);
    }
    while (!mp.empty()) {
        auto [l, r] = mp.begin()->first;
        auto qs = mp.begin()->second;
        mp.erase(mp.begin());
        if (l + 1 == r) {
            for (int i : qs) {
                ans[i] = r;
            }
            continue;
        }
        int mid = (l + r) / 2;
        dsu d(h * w);
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (i + 1 < h && a[i][j] <= mid && a[i + 1][j] <= mid) {
                    d.merge(i * w + j, (i + 1) * w + j);
                }
                if (j + 1 < w && a[i][j] <= mid && a[i][j + 1] <= mid) {
                    d.merge(i * w + j, i * w + j + 1);
                }
            }
        }
        vector<int> lq, rq;
        for (int i : qs) {
            if (d.same(rs[i] * w + cs[i], rt[i] * w + ct[i])) {
                lq.push_back(i);
            } else {
                rq.push_back(i);
            }
        }
        if (!lq.empty()) {
            mp[{l, mid}] = lq;
        }
        if (!rq.empty()) {
            mp[{mid, r}] = rq;
        }
    }
    for (int i = 0; i < q; i++) {
        cout << ans[i] << "\n";
    }
}