#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll h, w; cin >> h >> w;
    vector<vector<ll>> a(h+2, vector<ll>(w+2, 0));
    for(ll i=1; i<=h; i++) for(ll j=1; j<=w; j++) cin >> a[i][j];

    ll ans = 0;
    ll di[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
    ll dj[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
    vector<vector<bool>> visited(h+2, vector<bool>(w+2, false));
    for(ll i0=0; i0<=h+1; i0++) for(ll j0=0; j0<=w+1; j0++){
        if(!(i0==0 || i0==h+1 || j0==0 || j0==w+1)) continue;

        for(ll i1=0; i1<=h+1; i1++) for(ll j1=0; j1<=w+1; j1++){
            if(!(i1==0 || i1==h+1 || j1==0 || j1==w+1)) continue;

            for(ll k0=0; k0<8; k0++) for(ll k1=0; k1<8; k1++){
                ll sum = 0;
                {
                    ll now_i = i0, now_j = j0;
                    while(true){
                        now_i = now_i + di[k0], now_j = now_j + dj[k0];
                        if(now_i<=0 || now_i>=h+1 || now_j<=0 || now_j>=w+1) break;
                        sum += a[now_i][now_j];
                        visited[now_i][now_j] = true;
                    }
                }
                {
                    ll now_i = i1, now_j = j1;
                    while(true){
                        now_i = now_i + di[k1], now_j = now_j + dj[k1];
                        if(now_i<=0 || now_i>=h+1 || now_j<=0 || now_j>=w+1) break;
                        if(!visited[now_i][now_j]) sum += a[now_i][now_j];
                    }
                }
                {
                    ll now_i = i0, now_j = j0;
                    while(true){
                        now_i = now_i + di[k0], now_j = now_j + dj[k0];
                        if(now_i<=0 || now_i>=h+1 || now_j<=0 || now_j>=w+1) break;
                        visited[now_i][now_j] = false;
                    }
                }
                ans = max(ans, sum);
            }
        }
    }

    cout << ans << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}