#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

const ld G = 9.80665;
const int INF = 1e8;
const ld eps = 1e-6;

void solve() {
	int N, M;
	ld W, V;
	int rX, rY;
	cin >> M >> N >> W >> V >> rY >> rX;
	rY--; rX--;
	ld H[N][M];
	F0R(i, N) F0R(j, M) {
		cin >> H[i][j];
	}

	int dist[N][M]; 
	F0R(i, N) F0R(j, M) dist[i][j] = INF;
	dist[rX][rY] = 0;
	queue<pi> q; q.push({rX, rY});
	while (!q.empty()) {
		auto [x, y] = q.front(); q.pop();
		F0R(a, N) {
			F0R(b, M) {
				if (a == x && b == y) continue;
				if (dist[a][b] != INF) continue;
				ld dis = sqrt((a-x)*(a-x)+(b-y)*(b-y)) * W;
				ld distY = H[a][b] - H[x][y];
				ld ang = atan(V*V / G / dis);
				ld ti = dis / (V * cos(ang));
				ld capY = ti * V * sin(ang) - ti * ti * G / 2;
				if (capY <= distY) {
					continue;
				}
				ld lo = ang;
				ld hi = acos(-1)/2;
				F0R(iter, 60) {
					ld mid = (lo+hi)/2;
					ld ti = dis / (V * cos(mid));
					if (ti*V*sin(mid) - ti*ti*G / 2 > distY) {
						lo = mid;
					} else hi = mid;
				}
				ld co1 = H[x][y];
				ld coSq = -G/2/V/V/cos(lo)/cos(lo) * dis * dis;
				ld coX = tan(lo) * dis;
				//cout << coSq << " " << coX << " " << co1 << nl;
				int cx = x, cy = y;
				int dx = (a - x) / abs(a-x);
				int dy = (b-y) / abs(b-y);
				vd posXC, posYC;
				F0R(i, abs(a-x)) {
					posXC.pb((i+0.5)/abs(a-x));
				}
				F0R(i, abs(b-y)) {
					posYC.pb((i+0.5)/abs(b-y));
				}
				int px = 0, py = 0;
				while (cx != a || cy != b) {
					int sta = 2;
					if (cx == a) {
						sta = 1;
					} else if (cy == b) {
						sta = 0;
					} else {
						if (posXC[px] < posYC[py] - eps) {
							sta = 0;
						} else if (posYC[py] < posXC[px] - eps) {
							sta = 1;
						}
					}

					ld frac;
					int nx, ny;
					if (sta == 0) {
						frac = posXC[px]; px++;
						nx = cx + dx;
						ny = cy;
					} else if (sta == 1) {
						frac = posYC[py]; py++;
						ny = cy + dy;
						nx = cx;
					} else {
						frac = posXC[px]; px++;
						py++;
						nx = cx + dx;
						ny = cy + dy;
					}

					ld capH = 0;
					FOR(i, min(nx, cx), max(nx, cx) + 1) {
						FOR(j, min(ny, cy), max(ny, cy) + 1) {
							capH = max(capH, H[i][j]);
						}
					}
					/*cout << sta << " " << a << " " << b << " " << coX << " " << coY << nl;
					cout << capH << " " << frac << " " << -frac*frac+coX*frac+coY << nl;*/
					if (coSq * frac * frac + coX * frac + co1 < capH) {
						goto done;
					}
					cx = nx; cy = ny;
					//cout << x << " " << y << " " << a << " " << b << " " << cx << " " << cy << nl;
				}
				dist[a][b] = dist[x][y] + 1;
				q.push({a, b});
				done:
				;
			}
		}
	}
	F0R(i, N) {
		F0R(j, M) {
			if (dist[i][j] == INF) {
				cout << "X" << " ";
			} else {
				cout << dist[i][j] << " ";
			}
		}
		cout << nl;
	}
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}