#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int H, W; cin >> H >> W;
    vector A(H, vector<int>(W));
    rep(i, H)rep(j, W) cin >> A[i][j];
    int Q; cin >> Q;
    vector<int> rs(Q), cs(Q), rt(Q), ct(Q);
    rep(i, Q){
        cin >> rs[i] >> cs[i];
        cin >> rt[i] >> ct[i];
        rs[i]--, cs[i]--;
        rt[i]--, ct[i]--;
    }

    int V = H * W;
    vector<vector<pii>> B(V + 1);
    rep(i, H)rep(j, W) B[A[i][j]].push_back({i, j});

    vector<int> ok(Q, H * W), ng(Q, 0);
    while(true){
        bool finish = true;

        vector<vector<int>> query(H * W + 1);
        rep(i, Q)if(abs(ok[i] - ng[i]) > 1){
            finish = false;
            query[(ok[i] + ng[i]) / 2].push_back(i);
        }
        if(finish) break;

        dsu uf(H * W);
        rep(mid, H * W + 1){
            for(auto &[i, j] : B[mid])rep(d, 4){
                int ni = i + di[d], nj = j + dj[d];
                if(ni < 0 || ni >= H || nj < 0 || nj >= W) continue;
                if(A[ni][nj] > mid) continue;
                uf.merge(ni * W + nj, i * W + j);
            }

            for(auto &qi : query[mid]){
                if(uf.same(rs[qi] * W + cs[qi], rt[qi] * W + ct[qi])) ok[qi] = mid;
                else ng[qi] = mid;
            }
        }
    }

    rep(i, Q) cout << ok[i] << endl;
}