#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN (55)
int map[MAXN][MAXN];
int dp[MAXN][MAXN][MAXN][MAXN];

int main()
{
    freopen("message.in", "r", stdin);
    freopen("message.out", "w", stdout);
	int i,j,k,l;
	int n,m;
	cin >> m >> n;
	for(i = 1; i <= m; i++)
		for(j = 1; j <= n; j++)
			scanf("%d", &map[i][j]);
	
	for(i = 1; i <= m; i++)
	{
		for(j = 1; j <= n; j++)
		{
			for(k = 1; k <= m; k++)
			{
				for(l = 1; l <= n; l++)
				{
					dp[i][j][k][l] = max(dp[i][j][k][l], dp[i-1][j][k-1][l]);
					dp[i][j][k][l] = max(dp[i][j][k][l], dp[i-1][j][k][l-1]);
					dp[i][j][k][l] = max(dp[i][j][k][l], dp[i][j-1][k-1][l]);
					dp[i][j][k][l] = max(dp[i][j][k][l], dp[i][j-1][k][l-1]);
					dp[i][j][k][l] += map[i][j];
					if(i != k || j != l)
						dp[i][j][k][l] += map[k][l];
				}
			}
		}
	}
	cout << dp[m][n][m][n];
	return 0;
}