#include <bits/stdc++.h>
using namespace std;
const int inf=1000000000;
int na,nb,nc,nd,a,b,c,d,sq,cur,v[44][44][44][44],s[44][44][44][44];
long long l,r,h;
bool was;
int main() {
  scanf("%d%d%d%d",&na,&nb,&nc,&nd);
  scanf("%d%d%d%d",&a,&b,&c,&d);
  sq=a*b*c*d;
  for(int i=1; i<=na; i++) for(int j=1; j<=nb; j++)
    for(int k=1; k<=nc; k++) for(int l=1; l<=nd; l++) {
      scanf("%d",&v[i][j][k][l]);
      v[i][j][k][l]+=inf;
    }
  l=0; r=2*inf;
  while (l<r) {
    h=(l+r)/2;
    was=false;
    for(int i=1; i<=na; i++) for(int j=1; j<=nb; j++)
      for(int k=1; k<=nc; k++) for(int l=1; l<=nd; l++) {
        s[i][j][k][l]=s[i-1][j][k][l]+s[i][j-1][k][l]+s[i][j][k-1][l]+s[i][j][k][l-1]
          -s[i-1][j-1][k][l]-s[i-1][j][k-1][l]-s[i-1][j][k][l-1]
          -s[i][j-1][k-1][l]-s[i][j-1][k][l-1]-s[i][j][k-1][l-1]
          +s[i-1][j-1][k-1][l]+s[i-1][j-1][k][l-1]+s[i-1][j][k-1][l-1]+s[i][j-1][k-1][l-1]
          -s[i-1][j-1][k-1][l-1]+int(v[i][j][k][l]<=h);
        if (i>=a && j>=b && k>=c && l>=d) cur=s[i-a][j][k][l]+s[i][j-b][k][l]+s[i][j][k-c][l]+s[i][j][k][l-d]
          -s[i-a][j-b][k][l]-s[i-a][j][k-c][l]-s[i-a][j][k][l-d]
          -s[i][j-b][k-c][l]-s[i][j-b][k][l-d]-s[i][j][k-c][l-d]
          +s[i-a][j-b][k-c][l]+s[i-a][j-b][k][l-d]+s[i-a][j][k-c][l-d]+s[i][j-b][k-c][l-d]-s[i-a][j-b][k-c][l-d];
        cur=s[i][j][k][l]-cur;
        if (cur==sq) was=true;
      }
    if (was) r=h; else l=h+1;
  }
  printf("%d\n",int(r-inf));
  return 0;
}