#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

int h, w;
int si, sj;
vector<vii> choku(251, vii(251, vi(251, inf)));
vii a(251, vi(251, inf));

void solve1() {
  using P = pair<pii, pii>;
  priority_queue<P, vector<P>, greater<P>> qu;
  rep1 (k, 250) {
    qu.push(make_pair(pii(a[si][sj] + k*k, k), pii(si, sj)));
    choku[si][sj][k] = a[si][sj] + k*k;
  }
  while (not qu.empty()) {
    int cost = qu.top().first.first;
    int k = qu.top().first.second;
    int i = qu.top().second.first, j = qu.top().second.second;
    qu.pop();
    if (choku[i][j][k] < cost) continue;
    rep (l, 4) {
      int ni = i + dx[l], nj = j + dy[l];
      if (not in(ni, 0, h) or not in(nj, 0, w)) continue;
      int ncost = cost + a[ni][nj] + k*k;
      if (choku[ni][nj][k] > ncost) {
        qu.push(make_pair(pii(ncost, k), pii(ni, nj)));
        choku[ni][nj][k] = ncost;
      }
    }
  }
}

int main() {
  cin >> h >> w;
  cin >> si >> sj;
  si--; sj--;
  rep (i, h) rep (j, w) cin >> a[i][j];

  solve1();
  int q;
  cin >> q;
  rep (i, q) {
    ll y, x, k;
    cin >> y >> x >> k;
    y--; x--;
    if (k <= 250) {
      cout << choku[y][x][k] << '\n';
    }
    else {
      ll kyori = abs(si - y) + abs(sj - x) + 1;
      ll ans = choku[y][x][250] - 250*250*kyori + k*k*kyori;
      cout << ans << '\n';
    }

  }
}