#include <fstream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <ctime>

#define pi pair<int, int>
#define x first
#define y second
#define mp make_pair
#define pb push_back

using namespace std;

ifstream in("matrice2.in");
ofstream out("matrice2.out");

const int N = 305;
const int Q = 20005;
const int NCELL = N * N;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

struct Query {
   pi first;
   pi last;
   int ind;

   Query(pi _first = mp(0, 0), pi _last = mp(0, 0), int _ind = 0) {
      first = _first;
      last = _last;
      ind = _ind;
   }
};

int n, q, m;
int v[N][N];
pi f[N][N];
pair<int, pi> cell[N * N];
vector<Query> query[N * N];
int qans[Q];

void reset_disjoint_set() {
   for(int i = 1; i <= n; i++) {
      for(int j = 1; j <= n; j++) {
         f[i][j] = mp(i, j);
      }
   }
}

pi _find(pi u) {
   if(f[u.x][u.y] != u) {
      f[u.x][u.y] = _find(f[u.x][u.y]);
   }
   return f[u.x][u.y];
}

bool _same(pi u, pi v) {
   return _find(u) == _find(v);
}

void _merge(pi u, pi v) {
   pi ru = _find(u), rv = _find(v);
   if(rand() & 1) {
      f[ru.x][ru.y] = rv;
   }
   else {
      f[rv.x][rv.y] = ru;
   }
}

int main() {
   srand(time(NULL));

   int i, j, k, p, x1, y1, x2, y2;

   in >> n >> q;
   for(i = 1; i <= n; i++) {
      for(j = 1; j <= n; j++) {
         in >> v[i][j];
         cell[++m] = mp(v[i][j], mp(i, j));
      }
   }
   sort(cell+1, cell+m+1);
   for(i = 1; i <= q; i++) {
      in >> x1 >> y1 >> x2 >> y2;
      query[0].emplace_back(mp(x1, y1), mp(x2, y2), i);
   }
   for(p = 1; p <= m; p <<= 1);
   for(p >>= 1; p > 0; p >>= 1) {
      reset_disjoint_set();
      for(j = m; j >= p; j--) {
         for(k = 0; k < 4; k++) {
            x1 = cell[j].second.x + dx[k];
            y1 = cell[j].second.y + dy[k];
            if(v[x1][y1] >= v[cell[j].second.x][cell[j].second.y]) {
               _merge(mp(x1, y1), cell[j].second);
            }
         }
         for(i = 0; i < query[j - p].size(); i++) {
            if(_same(query[j - p][i].first, query[j - p][i].last)) {
               query[j].pb(query[j - p][i]);
               swap(query[j - p][i], query[j - p].back());
               query[j - p].pop_back();
               i--;
            }
         }
      }
   }

   for(i = 1; i <= m; i++) {
      for(auto q : query[i]) {
         qans[q.ind] = cell[i].first;
      }
   }
   for(i = 1; i <= q; i++) {
      out << qans[i] << '\n';
   }
   return 0;
}