#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#define private public
#include<atcoder/all>
#undef private
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
const int di[] = {1, 0, -1, 0};
const int dj[] = {0, 1, 0, -1};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w;
  cin >> h >> w;
  VVI a(h, VI(w));
  rep(i, h) rep(j, w) cin >> a[i][j];
  vector<P> ord;
  ord.reserve(h * w);
  rep(i, h) rep(j, w) ord.emplace_back(i, j);
  ranges::sort(ord, {}, [&](P p) { return a[p.first][p.second]; });
  struct Q {
    int si, sj, ti, tj;
  };
  int q;
  cin >> q;
  vector<Q> qs(q);
  for (auto& [si, sj, ti, tj] : qs) cin >> si >> sj >> ti >> tj, si--, sj--, ti--, tj--;
  VI L(q, 0), R(q, h * w);
  VVI ask(h * w);
  dsu uf(h * w);
  auto idxchk = [&](int i, int j) { return 0 <= i && i < h && 0 <= j && j < w; };
  while (true) {
    bool done = true;
    rep(i, q) if (R[i] - L[i] > 1) {
      done = false;
      ask[(L[i] + R[i]) / 2].emplace_back(i);
    }
    if (done) break;
    uf.parent_or_size.assign(h * w, -1);
    rep(c, h * w) {
      while (ask[c].size()) {
        int i = ask[c].back();
        ask[c].pop_back();
        auto [si, sj, ti, tj] = qs[i];
        (uf.same(si * w + sj, ti * w + tj) ? R[i] : L[i]) = c;
      }
      auto [i, j] = ord[c];
      rep(k, 4) {
        int ni = i + di[k], nj = j + dj[k];
        if (!idxchk(ni, nj) || a[ni][nj] > a[i][j]) continue;
        uf.merge(i * w + j, ni * w + nj);
      }
    }
  }
  rep(i, q) {
    auto [x, y] = ord[R[i] - 1];
    cout << a[x][y] << '\n';
  }
}