#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

struct dsu {
    int n;
    vector<int> p, size;
    dsu(int n) : n(n), p(n + 1), size(n + 1, 1) {
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {
        while(x != p[x]) {
            p[x] = p[p[x]];
            x = p[x];
        }
        return x;
    }
    void merge(int x, int y) {
        int x_fa = find(x), y_fa = find(y);
        if(x_fa != y_fa) {
            p[y_fa] = x_fa;
            size[x_fa] += size[y_fa];
        }
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
};

void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> a(n * m);
    for (int i = 0; i < n * m; ++i) {
        cin >> a[i];
    }

    vector<int> id(n * m);
    iota(id.begin(), id.end(), 0);

    sort(id.begin(), id.end(), [&] (auto& x, auto& y) {
        return a[x] < a[y];
    });

    array<int, 4> dx{0, 1, 0, -1};
    array<int, 4> dy{1, 0, -1, 0};
 
    dsu d(2 * n * m);
    vector g(2 * n * m, vector<int>());
    int pos = n * m;
    vector<int> val(2 * n * m);
    vector<bool> vis(n * m);
    for (auto& x : id) {
        vis[x] = true;
        for (int i = 0; i < 4; ++i) {
            int xx = x / m + dx[i], yy = x % m + dy[i];
            int y = xx * m + yy;
            if (xx >= 0 && xx < n && yy >= 0 && yy < m && vis[y]) {
                int u = d.find(x), v = d.find(y);
                if (u == v) {
                    continue;
                }
                g[pos].push_back(u);
                g[u].push_back(pos);
                g[pos].push_back(v);
                g[v].push_back(pos);
                d.merge(pos, u);
                d.merge(pos, v);
                val[pos] = a[x];
                pos++;
            }
        }
    }

    const int lg = __lg(2 * n * m);
    vector<int> dep(2 * n * m);
    vector fa(lg + 1, vector<int>(2 * n * m, -1));
    vector w(lg + 1, vector<int>(2 * n * m));

    auto dfs = [&] (auto dfs, int u, int f) -> void {
        w[0][u] = val[u];
        for (int i = 1; i <= lg; ++i) {
            if (fa[i - 1][u] == -1) {
                continue;
            }
            fa[i][u] = fa[i - 1][fa[i - 1][u]];
            w[i][u] = max(w[i - 1][u], w[i - 1][fa[i - 1][u]]);
        }
        for (auto& v: g[u]) {
            if (v == f) {
                continue;
            }
            fa[0][v] = u;
            dep[v] = dep[u] + 1;
            dfs(dfs, v, u);
        }
    };
    dfs(dfs, 0, -1);

    auto query = [&] (int u, int v) {
        if (dep[u] < dep[v]) {
            swap(u, v);
        }

        int maxx = 0;

        for (int i = lg; i >= 0; --i) {
            if (dep[u] - (1 << i) >= dep[v]) {
                maxx = max(maxx, w[i][u]);
                u = fa[i][u];
                maxx = max(maxx, w[0][u]);
            }
        }

        if (u == v) {
            return maxx;
        }

        for (int i = lg; i >= 0; --i) {
            if (fa[i][u] != fa[i][v]) {
                maxx = max(maxx, w[i][u]);
                u = fa[i][u];
                maxx = max(maxx, w[0][u]);

                maxx = max(maxx, w[i][v]);
                v = fa[i][v];
                maxx = max(maxx, w[0][v]);
            }
        }


        return max(maxx, w[0][fa[0][u]]);
    };


    int q;
    cin >> q;
    for (int i = 0; i < q; ++i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        --x1, --y1, --x2, --y2;
        cout << query(x1 * m + y1, x2 * m + y2) << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}