/* -*- coding: utf-8 -*-
 *
 * 2786.cc:  No.2786 RMQ on Grid Path - yukicoder
 */

#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_H = 500;
const int MAX_W = 500;
const int MAX_HW = MAX_H * MAX_W;
const int MAX_QN = 200000;
const int dxs[] = { 1, 0, -1, 0 }, dys[] = { 0, -1, 0, 1 };

/* typedef */

typedef vector<int> vi;
typedef set<int> si;

struct UFT {
  vector<int> links, ranks, sizes;
  UFT() {}

  void init(int n) {
    links.resize(n);
    for (int i = 0; i < n; i++) links[i] = i;
    ranks.assign(n, 1);
    sizes.assign(n, 1);
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

int as[MAX_HW], uas[MAX_HW], mncs[MAX_QN];
vi avs[MAX_HW];
si gps[MAX_HW];
UFT uft;

/* subroutines */

/* main */

int main() {
  int h, w;
  scanf("%d%d", &h, &w);
  int hw = h * w;
  for (int i = 0; i < hw; i++) scanf("%d", as + i);

  copy(as, as + hw, uas);
  sort(uas, uas + hw);
  int m = unique(uas, uas + hw) - uas;

  for (int i = 0; i < hw; i++) {
    int ai = lower_bound(uas, uas + m, as[i]) - uas;
    avs[ai].push_back(i);
  }

  int qn;
  scanf("%d", &qn);
  for (int i = 0; i < qn; i++) {
    int y0, x0, y1, x1;
    scanf("%d%d%d%d", &y0, &x0, &y1, &x1);
    y0--, x0--, y1--, x1--;
    gps[y0 * w + x0].insert(i);
    gps[y1 * w + x1].insert(i);
  }

  uft.init(hw);
  for (int i = 0; i < m; i++) {
    for (auto u: avs[i]) {
      int uy = u / w, ux = u % w;
      for (int di = 0; di < 4; di++) {
	int vy = uy + dys[di], vx = ux + dxs[di], v = vy * w + vx;
	if (vy >= 0 && vy < h && vx >= 0 && vx < w &&
	    as[v] <= uas[i]) {
	  int ru = uft.root(u), rv = uft.root(v);
	  if (ru != rv) {
	    int r0 = uft.merge(ru, rv);
	    int r1 = (r0 == ru) ? rv : ru;
	    if (gps[r0].size() < gps[r1].size())
	      swap(gps[r0], gps[r1]);

	    for (int p1: gps[r1]) {
	      auto sit = gps[r0].find(p1);
	      if (sit != gps[r0].end()) {
		mncs[p1] = uas[i];
		gps[r0].erase(sit);
	      }
	      else {
		gps[r0].insert(p1);
	      }
	    }
	  }
	}
      }
    }
  }

  for (int i = 0; i < qn; i++) printf("%d\n", mncs[i]);

  return 0;
}