using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (h, w) = (c[0], c[1]);
        c = NList;
        var (gx, gy) = (c[0] - 1, c[1] - 1);
        var a = NArr(h);
        var q = NN;
        var query = NArr(q);
        var max = 112;
        var lv = new bool[max];
        foreach (var que in query) if (que[2] < lv.Length) lv[que[2]] = true;

        var mx = new int[] { -1, 1, 0, 0 };
        var my = new int[] { 0, 0, -1, 1 };
        var INF = int.MaxValue / 2;
        var init = Enumerable.Repeat(INF, w).ToArray();
        var map = new int[max + 1][][];
        for (var l = 0; l < max; ++l)
        {
            if (!lv[l]) continue;
            map[l] = new int[h][];
            for (var i = 0; i < h; ++i) map[l][i] = (int[]) init.Clone();
            map[l][gx][gy] = a[gx][gy] + l * l;
            var pq = new PriorityQueue<(int cx, int cy, int len), int>();
            pq.Enqueue((gx, gy, map[l][gx][gy]), map[l][gx][gy]);
            while (pq.Count > 0)
            {
                var cur = pq.Dequeue();
                if (cur.len != map[l][cur.cx][cur.cy]) continue;
                for (var i = 0; i < 4; ++i)
                {
                    var nx = cur.cx + mx[i];
                    var ny = cur.cy + my[i];
                    if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
                    if (map[l][nx][ny] <= cur.len + l * l + a[nx][ny]) continue;
                    map[l][nx][ny] = cur.len + l * l + a[nx][ny];
                    pq.Enqueue((nx, ny, map[l][nx][ny]), map[l][nx][ny]);
                }
            }
        }
        {
            map[max] = new int[h][];
            for (var i = 0; i < h; ++i) map[max][i] = (int[]) init.Clone();
            map[max][gx][gy] = a[gx][gy];
            for (var i = gx - 1; i >= 0; --i) map[max][i][gy] = map[max][i + 1][gy] + a[i][gy];
            for (var i = gx + 1; i < h; ++i) map[max][i][gy] = map[max][i - 1][gy] + a[i][gy];
            for (var j = gy - 1; j >= 0; --j) map[max][gx][j] = map[max][gx][j + 1] + a[gx][j];
            for (var j = gy + 1; j < w; ++j) map[max][gx][j] = map[max][gx][j - 1] + a[gx][j];
            for (var i = gx - 1; i >= 0; --i)
            {
                for (var j = gy - 1; j >= 0; --j)
                    map[max][i][j] = Math.Min(map[max][i + 1][j], map[max][i][j + 1]) + a[i][j];
                for (var j = gy + 1; j < w; ++j)
                    map[max][i][j] = Math.Min(map[max][i + 1][j], map[max][i][j - 1]) + a[i][j];
            }
            for (var i = gx + 1; i < h; ++i)
            {
                for (var j = gy - 1; j >= 0; --j)
                    map[max][i][j] = Math.Min(map[max][i - 1][j], map[max][i][j + 1]) + a[i][j];
                for (var j = gy + 1; j < w; ++j)
                    map[max][i][j] = Math.Min(map[max][i - 1][j], map[max][i][j - 1]) + a[i][j];
            }
        }
        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            if (query[i][2] < max) ans[i] = map[query[i][2]][query[i][0] - 1][query[i][1] - 1];
            else ans[i] = map[max][query[i][0] - 1][query[i][1] - 1] + (Math.Abs(gx - query[i][0] + 1L) + Math.Abs(gy - query[i][1] + 1L) + 1) * query[i][2] * query[i][2];
        }
        WriteLine(string.Join("\n", ans));
    }
}