n,m=map(int,input().split())
arr=[list(map(int,input().split())) for r in range(n)]
a,b=map(int,input().split())
mx=10000000;
for i in range(n-a+1):
for j in range(m-b+1):
count=0;
for w in range(i,i+a):
for e in range(j,j+b):
count+=arr[w][e]
mx=min(mx,count)
for i in range(n-b+1):
for j in range(m-a+1):
count=0;
for w in range(i,i+b):
for e in range(j,j+a):
count+=arr[w][e]
mx=min(mx,count)
print(mx)
455A - Boredom | 1099A - Snowball |
1651D - Nearest Excluded Points | 599A - Patrick and Shopping |
237A - Free Cash | 1615B - And It's Non-Zero |
1619E - MEX and Increments | 34B - Sale |
1436A - Reorder | 1363C - Game On Leaves |
1373C - Pluses and Minuses | 1173B - Nauuo and Chess |
318B - Strings of Power | 1625A - Ancient Civilization |
864A - Fair Game | 1663B - Mike's Sequence |
448A - Rewards | 1622A - Construct a Rectangle |
1620A - Equal or Not Equal | 1517A - Sum of 2050 |
620A - Professor GukiZ's Robot | 1342A - Road To Zero |
1520A - Do Not Be Distracted | 352A - Jeff and Digits |
1327A - Sum of Odd Integers | 1276A - As Simple as One and Two |
812C - Sagheer and Nubian Market | 272A - Dima and Friends |
1352C - K-th Not Divisible by n | 545C - Woodcutters |