#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using lg = long long;
using pii = pair<int, int>;
using pll = pair<lg, lg>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
// #define AMARI 1000000007
#define TEMOTO ((sizeof(long double) == 16) ? false : true)
#define TIME_LIMIT 1980 * (TEMOTO ? 1 : 1000)
#define el '\n'
#define El '\n'

#define MULTI_TEST_CASE false
void solve(void) {
    int h,w;
    cin >> h >> w;
    vector<vector<int>> a(h,vector<int>(w));
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            cin >> a[i][j];
        }
    }
    int ans = 0;
    int mhx = max(h,w);
    vector<pii> d = {pair(1,0),pair(0,1),pair(1,1),pair(1,-1)};
    for(int di = 0; di < 4; di++){
        for(int dj = 0; dj < 4; dj++){
            
            //i*d[di].first + j*d[di].second == kなるやつを探す このうち負になり得るのはd[di].secondだけだから下は-w以上
            for(int k = -w; k <= h + w; k++){
                for(int l = -w; l <= h + w; l++){
                    int temp = 0;
                    for(int i = 0; i < h; i++){
                        for(int j = 0; j < w; j++){
                            if(i * d[di].first + j * d[di].second == k || i * d[dj].first + j * d[dj].second == l){
                                temp += a[i][j];
                            }
                        }
                    }
                    ans = max(ans,temp);
                }
            }
        }
    }
    
    cout << ans << el;
    return;
}

void calc(void) {
    return;
}

signed main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE) cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}