#include using namespace std; #pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={-1,0,1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } const ll M=2500; ll dp[M][250][250]; int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); ll h,w;cin >> h >> w; ll x,y;cin >> x >> y;x--;y--; vvl g(h,vl(w));rep(i,h)rep(j,w)cin >> g[i][j]; if(h*w>50000){ vl mle(INF);return 0; } rep(k,M){ rep(i,h)rep(j,w)dp[k][i][j]=INF; dp[k][x][y]=g[x][y]+k*k; priority_queue> que; que.push({g[x][y]+k*k,x*w+y}); while(que.size()){ auto [dist,v]=que.top();que.pop(); ll nx=v/w,ny=v%w; if(dp[k][nx][ny]!=dist)continue; rep(i,4){ ll nnx=nx+dx[i],nny=ny+dy[i]; if(nnx<0||nny<0||nnx>=h||nny>=w)continue; ll ncost=dist+g[nnx][nny]+k*k; if(dp[k][nnx][nny]<=ncost)continue; dp[k][nnx][nny]=ncost; que.push({ncost,nnx*w+nny}); } } } ll q;cin >> q; while(q--){ ll nx,ny,k;cin >> nx >> ny >> k;nx--;ny--; if(k