#include<cstdio>
#define N 305
#include<algorithm>
using namespace std;
int n,m,xs,ys,xk,yk;
int a[N][N],dp[N][N];
signed main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			scanf("%d",&a[i][j]);
			//dp[i][j]=max(dp[i-1][j]+a[i][j],dp[i][j-1]+a[i][j]);
		}
	}
	scanf("%d%d%d%d",&xs,&ys,&xk,&yk);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(i<=xs&&j<=ys){
				dp[i][j]=max(a[i][j-1]+dp[i-1][j]+a[i][j],dp[i][j-1]+a[i-1][j]+a[i][j]);
			}
			else dp[i][j]=max(dp[i-1][j]+a[i][j],dp[i][j-1]+a[i][j]);
			//printf("%d %d %d\n",i,j,dp[i][j]);
		}
	}
	printf("%d",dp[xk][yk]);
	return 0;
}