#include <bits/stdc++.h>
using namespace std;
#define FINISH cerr << "FINISH" << endl;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 200020;
int up(int x, int m)
{
	int r = (x % m + m) % m;
	if (r == 0)
		r = m;
	return r;
}
void solve()
{
	int n, m, x, y, w;
	cin >> n >> m >> x >> y >> w;
	vector<vector<int>> a(n + 1, vector<int>(m + 1, 0));
	a[x][y] = w;
	int tmp = 0;
	for (int i = 1; i <= m; i += 2) {
		if (i == m) {
			for (int j = 1; j <= n; j++) {
				a[j][i] = ++tmp;
			}
		}
		else {
			for (int j = 1; j <= n; j++) {
				if (j % 2 == 1) {
					a[j][i] = ++tmp;
					a[j][i + 1] = ++tmp;
				}
				else {
					a[j][i + 1] = ++tmp;
					a[j][i] = ++tmp;
				}
			}
		}
	}
	int res = w - a[x][y];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			a[i][j] = up(a[i][j] + res, n * m);
			cout << a[i][j] << " ";
		}
		cout << el;
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}