#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstring>
#include<deque>
#define itn int
#define coder goodboy
using namespace std;
typedef long long LL;typedef unsigned long long ULL;
const int maxn=120;
LL a[maxn][maxn],f[maxn][maxn],ans=0;int n,m;
inline void in(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++){
		for (int j=1;j<=m;j++){
			scanf("%lld",&a[i][j]);
		}
	}
}
inline void dp(){
	for (int k=1;k<=n;k++){
		memset(f,0,sizeof(f));
		for (int d=1;d<=m;d++){
			for (int i=1;i<=m-d+1;i++){
				int j=i+d-1;
				LL temp=max(f[i+1][j]+a[k][i],f[i][j-1]+a[k][j]);
				f[i][j]+=2*temp;
			}
		}
		ans+=f[1][n];
	}
}
int Main(){
	freopen("game.in","r",stdin);
	freopen("game.out","w",stdout);
	in();
	dp();
	printf("%lld",ans);
	return 0;
}
int main(){;}
int goodboy=Main();