#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int INF = 1001001001;

int M, N;
vector<vector<int>> R, C;
int Q;
vector<int> X0, Y0, X1, Y1;

vector<int> ans;

void rec(int xL, int xR, int yL, int yR, const vector<int> &qs) {
  if (!qs.size()) return;
  vector<int> dist((xR - xL) * (yR - yL));
  auto id = [&](int x, int y) -> int {
    return (x - xL) * (yR - yL) + (y - yL);
  };
  auto shortest = [&](int x0, int y0) -> void {
    using Entry = pair<int, int>;
    priority_queue<Entry, vector<Entry>, greater<Entry>> que;
    fill(dist.begin(), dist.end(), INF);
    const int src = id(x0, y0);
    que.emplace(dist[src] = 0, src);
    for (; que.size(); ) {
      const int c = que.top().first;
      const int u = que.top().second;
      que.pop();
      if (dist[u] == c) {
        auto visit = [&](int xx, int yy, int cc) -> void {
          const int v = id(xx, yy);
          if (chmin(dist[v], cc)) que.emplace(cc, v);
        };
        const int x = xL + u / (yR - yL);
        const int y = yL + u % (yR - yL);
        if (y - 1 >= yL) visit(x, y - 1, c + R[x][y - 1]);
        if (y + 1 <  yR) visit(x, y + 1, c + R[x][y]);
        if (x - 1 >= xL) visit(x - 1, y, c + C[x - 1][y]);
        if (x + 1 <  xR) visit(x + 1, y, c + C[x][y]);
      }
    }
  };
  if (xR - xL > yR - yL) {
    const int xM = (xL + xR) / 2;
    for (int y = yL; y < yR; ++y) {
      shortest(xM, y);
      for (const int q : qs) chmin(ans[q], dist[id(X0[q], Y0[q])] + dist[id(X1[q], Y1[q])]);
    }
    vector<int> qsL, qsR;
    for (const int q : qs) {
      if (X0[q] < xM && X1[q] < xM) qsL.push_back(q);
      if (X0[q] > xM && X1[q] > xM) qsR.push_back(q);
    }
    rec(xL    , xM, yL, yR, qsL);
    rec(xM + 1, xR, yL, yR, qsR);
  } else {
    const int yM = (yL + yR) / 2;
    for (int x = xL; x < xR; ++x) {
      shortest(x, yM);
      for (const int q : qs) chmin(ans[q], dist[id(X0[q], Y0[q])] + dist[id(X1[q], Y1[q])]);
    }
    vector<int> qsL, qsR;
    for (const int q : qs) {
      if (Y0[q] < yM && Y1[q] < yM) qsL.push_back(q);
      if (Y0[q] > yM && Y1[q] > yM) qsR.push_back(q);
    }
    rec(xL, xR, yL    , yM, qsL);
    rec(xL, xR, yM + 1, yR, qsR);
  }
}

int main() {
  for (; ~scanf("%d%d", &M, &N); ) {
    R.assign(M, vector<int>(N - 1));
    for (int x = 0; x < M; ++x) for (int y = 0; y < N - 1; ++y) scanf("%d", &R[x][y]);
    C.assign(M - 1, vector<int>(N));
    for (int x = 0; x < M - 1; ++x) for (int y = 0; y < N; ++y) scanf("%d", &C[x][y]);
    scanf("%d", &Q);
    X0.resize(Q);
    Y0.resize(Q);
    X1.resize(Q);
    Y1.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d%d", &X0[q], &Y0[q], &X1[q], &Y1[q]);
      --X0[q];
      --Y0[q];
      --X1[q];
      --Y1[q];
    }
    
    vector<int> qs(Q);
    for (int q = 0; q < Q; ++q) qs[q] = q;
    ans.assign(Q, INF);
    rec(0, M, 0, N, qs);
    
    for (int q = 0; q < Q; ++q) {
      printf("%d\n", ans[q]);
    }
  }
  return 0;
}