Codeforces Beta Round #45 B. Land Lot
http://www.codeforces.com/contest/48/problem/B:title=Land Lot]
def read(): return map(int,raw_input().split()) n,m = read() G = [read() for i in range(n)] a,b = read() ans = n*m for i in range(n-a+1): for j in range(m-b+1): t = sum([sum(g[j:j+b]) for g in G[i:i+a]]) ans = min(ans,t) for i in range(n-b+1): for j in range(m-a+1): t = sum([sum(g[j:j+a]) for g in G[i:i+b]]) ans = min(ans,t) print ans