#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() { return abs((int)mt()); }
void chemthan() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> a(n, vector<int>(m));
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (m); ++j) cin >> a[i][j], a[i][j]--;
  vector<vector<vector<int>>> ds(k,
                                 vector<vector<int>>(n, vector<int>(m, INF)));
  for (int t = (0); t < (k); ++t) {
    auto& d = ds[t];
    queue<int> que;
    vector<vector<pair<int, int>>> gg(k);
    for (int i = (0); i < (n); ++i)
      for (int j = (0); j < (m); ++j) {
        if (a[i][j] == t) {
          d[i][j] = 0, que.push(i), que.push(j);
        } else {
          gg[a[i][j]].push_back({i, j});
        }
      }
    while (int((que).size())) {
      int u = que.front();
      que.pop();
      int v = que.front();
      que.pop();
      auto inside = [&](int u, int v) {
        if (!(0 <= u && u < n)) return 0;
        if (!(0 <= v && v < m)) return 0;
        return 1;
      };
      int t = a[u][v];
      while (int((gg[t]).size())) {
        int uu = gg[t].back().first;
        int vv = gg[t].back().second;
        gg[t].pop_back();
        if (chkmin(d[uu][vv], d[u][v] + 1)) {
          que.push(uu), que.push(vv);
        }
      }
      for (int i = (-1); i < (1 + 1); ++i)
        for (int j = (-1); j < (1 + 1); ++j)
          if (abs(i) + abs(j) == 1) {
            int nu = u + i;
            int nv = v + j;
            if (inside(nu, nv)) {
              if (chkmin(d[nu][nv], d[u][v] + 1)) {
                que.push(nu), que.push(nv);
              }
            }
          }
    }
  }
  int q;
  cin >> q;
  while (q--) {
    vector<int> x(2), y(2);
    for (int i = (0); i < (2); ++i) cin >> x[i] >> y[i], x[i]--, y[i]--;
    int res = abs(x[0] - x[1]) + abs(y[0] - y[1]);
    if (a[x[0]][y[0]] == a[x[1]][y[1]]) {
      chkmin(res, 1);
    }
    for (int t = (0); t < (k); ++t) {
      chkmin(res, ds[t][x[0]][y[0]] + ds[t][x[1]][y[1]] + 1);
    }
    cout << res << "\n";
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
