// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 155, M = 505, INF = 2e9;

int n, m, a[N][M], f[11][N][N], g[11][N][N], s[N], gx[N], ans;

void inline wk() {
	ans = -INF;
	memset(f, 0xcf, sizeof f);
	for (int i = 1; i <= m; i++) {
		memcpy(g, f, sizeof f);
		memset(f, 0xcf, sizeof f);
		for (int j = 1; j <= n; j++) s[j] = s[j - 1] + a[j][i];
		for (int k = 0; k < 11; k++) {
			for (int x = 1; x <= n; x++) {
				for (int y = x; y <= n; y++) {
					if (k == 3) {
						chkMax(f[k][1][1], g[k - 1][x][y]);
					} else if (k == 7) {
						chkMax(f[k][1][1], g[k - 1][x][y]);
					}
					if (((k <= 6 && k >= 4) || (k <= 10 && k >= 8)) && y - x + 1 < 3) continue;
					int w = s[y] - s[x - 1];
					if (k == 5 || k == 8 || k == 10) w = a[x][i] + a[y][i];
					if (k == 7 || k == 3) w = 0;
					if (k != 4 && k != 6) chkMax(f[k][x][y], g[k][x][y] + w);
					if (k == 0) chkMax(f[k][x][y], w);
					if (k == 4 || k == 8) {
						chkMax(f[k][x][y], g[k - 1][1][1] + w);
					}
					if (k == 5 || k == 6 || k == 9 || k == 10) {
						chkMax(f[k][x][y], g[k - 1][x][y] + w);
					}
				}
			}
		}	
		
		// 0 -> 1
		for (int y = 1; y <= n; y++) {
			int v = -INF;
			for (int x = 1; x <= y; x++) {
				chkMax(f[1][x][y], v + s[y] - s[x - 1]);
				chkMax(v, g[0][x][y]);
			}
		}

		// 1 -> 2
		for (int x = 1; x <= n; x++) {
			int v = -INF;
			for (int y = x; y <= n; y++) {
				chkMax(f[2][x][y], v + s[y] - s[x - 1]);
				chkMax(v, g[1][x][y]);
			}
		}

		// 1 -> 1
		memset(gx, 0xcf, sizeof gx);
		for (int x = n; x; x--) {
			int v = -INF;
			for (int y = n; y >= x - 1; y--) {
				chkMax(v, g[1][x][y]);
				chkMax(gx[y], v);
				if (x <= y) chkMax(f[1][x][y], gx[y] + s[y] - s[x - 1]);
			}
		}

		

		for (int x = 1; x <= n; x++) 
			for (int y = x; y <= n; y++)
				chkMax(ans, f[10][x][y]);
	}
}

int main() {
	read(n), read(m);
    for (int i = 1; i <= n; i++)
    	for (int j = 1; j <= m; j++) read(a[n - i + 1][j]);
    wk();
	printf("%d\n", ans);
    return 0;
}