import sys
input = sys.stdin.readline
from heapq import heappush,heappop

# def divmod(x,mod):
    
#     a = x//mod
#     return a,x-a*mod
h,w = map(int,input().split())
gx,gy = [int(x)-1 for x in input().split()]
A = [list(map(int,input().split())) for i in range(h)]

inf = 10**20
dp = [[[inf]*(500) for i in range(w)] for j in range(h)]
dist = [[inf]*w for i in range(h)]
step = [[inf]*w for i in range(h)]
upd = [[-1]*w for i in range(h)]
first = [[-1]*w for i in range(h)]
dist[gx][gy] = A[gx][gy]
dp[gx][gy][0] = A[gx][gy]
step[gx][gy] = 0
H = [[gx,gy]]
dx = [1,0,-1,0]
dy = [0,1,0,-1]
mod2 = 1<<16

for d in range(500):
    nH = []

    for x,y in H:
        c = dp[x][y][d]
        if dp[x][y][d] != c:
            continue
        if first[x][y] == -1:
            first[x][y] = [c,d+1]
        # print(d,c,x,y)
        for i in range(4):
            nx = x+dx[i]
            ny = y+dy[i]
            if nx < 0 or nx >= h or ny < 0 or ny >= w:
                continue
            nc = c + A[nx][ny]
            if dist[nx][ny] <= nc:
                continue
            if d < 499 and dp[nx][ny][d+1] > nc:
                dp[nx][ny][d+1] = nc
                dist[nx][ny] = nc
                step[nx][ny] = d+1
                if upd[nx][ny] != d+1:
                    upd[nx][ny] = d+1
                    nH.append([nx,ny])
    if nH:
        H = nH
    else:
        break


q = int(input())
for _ in range(q):
    x,y,k = map(int,input().split())
    x -= 1
    y -= 1

    if k >= 222:
        ans,d = first[x][y]
        ans += d*k**2
        print(ans)
        continue
    ans = inf
    k = k**2
    nc = k
    ndp = dp[x][y]

    for i in range(step[x][y]+1):
        if ans > ndp[i]+nc:
            ans = ndp[i]+nc
        nc += k

    print(ans)