#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;

int main() {
    int H, W;
    cin >> H >> W;
    int gx, gy;
    cin >> gx >> gy;
    gx--; gy--;
    vector<vector<int>> A(H, vector<int>(W));
    for (int h = 0; h < H; ++h) {
        for (int w = 0; w < W; ++w) {
            cin >> A[h][w];
        }
    }
    int Q;
    cin >> Q;
    const int K = 251;
    vector<vector<tuple<int,int,int,int>>> query(K + 1);
    for (int q = 0; q < Q; ++q) {
        int x, y, k;
        cin >> x >> y >> k;
        x--; y--;
        query[min(k, K)].push_back({x, y, k, q});
    }
    vector<long long> ans_lst(Q);
    for (int k = 0; k <= K; ++k) {
        long long w = k < K ? k * k : (1 << 30);
        long long inf = (1LL << 60);
        vector<vector<long long>> dist(H, vector<long long>(W, inf));
        dist[gx][gy] = 0;
        priority_queue<tuple<long long, int, int>> queue;
        queue.push({-dist[gx][gy], gx, gy});
        while (!queue.empty()) {
            auto [d, x, y] = queue.top();
            queue.pop();
            d = -d;
            for (auto [dx, dy] : vector<pair<int, int>>{{0,1},{1,0},{0,-1},{-1,0}}) {
                int xx = x + dx, yy = y + dy;
                if (0 <= xx && xx < H && 0 <= yy && yy < W) {
                    long long dd = d + w + A[xx][yy];
                    if (dist[xx][yy] > dd) {
                        dist[xx][yy] = dd;
                        queue.push({-dd, xx, yy});
                    }
                }
            }
        }
        for (auto [x, y, c, q] : query[k]) {
            if (k < K) {
                ans_lst[q] = dist[x][y] + c * c + A[gx][gy];
            } else {
                long long cnt=dist[x][y]/w;
                long long d=dist[x][y]%w;
                ans_lst[q] = (cnt + 1) * c * c + d + A[gx][gy];
            }
        }
    }
    for (int i = 0; i < Q; ++i) {
        cout << ans_lst[i] << endl;
    }
    return 0;
}