#include<bits/stdc++.h>
using namespace std;
#ifdef IAKIOI
	#define cin fin
    ifstream cin("in.txt");
#endif
#define fi first
#define se second
template<typename cmp>
struct Queue
{
	int k, cnt;
	deque<pair<int,int>>q;
	inline void init(int _k)
	{
		k = _k;
		cnt = 0;
	}
	inline void push(int x)
	{
		++cnt;
		if (!q.empty() && cnt - q.front().se + 1 > k)
		{
			q.pop_front();
		}
		while (!q.empty() && cmp()(x, q.back().fi)) 
			q.pop_back();
		q.emplace_back(x, cnt);
	}
	inline int qry()
	{
		return q.front().fi;
	}
};
constexpr int N = 4005;
int c[N][N], dx[N][N], ans[N][N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int a, b, n, m;
    cin >> a >> b;
    for (int i = 1; i <= a; ++i)
    	for (int j = 1; j <= b; ++j)
    		cin >> c[i][j];
    cin >> n >> m;
    for (int i = 1; i <= a; ++i) {
    	Queue<greater<int>>mx;
    	mx.init(m);
    	for (int j = 1; j <= b; ++j) {
    		mx.push(c[i][j]);
    		dx[i][j] = mx.qry();
		}
	}
	for (int j = m; j <= b; ++j) {
    	Queue<greater<int>>mx;
    	mx.init(n);
		for (int i = 1; i <= a; ++i) {
			mx.push(dx[i][j]);
			if (i >= n) {
                ans[i][j] = mx.qry();
            }
		}
	}
    for (int i = n; i <= a; ++i) {
        for (int j = m; j <= b; ++j) {
            cout << ans[i][j] << ' ';
        } cout << '\n';
    }
    return 0;
}