#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int h, w;
    cin >> h >> w;
    vector<vector<int>> a(h, vector<int>(w));
    rep(i,h)rep(j,w) cin >> a[i][j];
    ll ans = 0;
    vector<pair<int,int>> vs;
    rep(i,w) vs.emplace_back(0,i);
    rep(i,w) vs.emplace_back(h-1,i);
    rep(j,h) vs.emplace_back(j,0);
    rep(j,h) vs.emplace_back(j,w-1);
    sort(vs.begin(),vs.end());
    vs.erase(unique(vs.begin(),vs.end()), vs.end());
    int n = vs.size();
    rep(i,n){
      rep(j,i+1){
        auto [x_1, y_1] = vs[i];
        auto [x_2, y_2] = vs[j];
        for(int dx=0;dx<=1;dx++){
          for(int dy=0;dy<=1;dy++){
            if(dx==0 && dy==0) continue;
            for(int ex=0;ex<=1;ex++){
              for(int ey=0;ey<=1;ey++){
                if(ex==0 && ey==0) continue;
                ll sum = 0;
                set<pair<int, int>> st;
                int x1 = x_1;
                int y1 = y_1;
                int x2 = x_2;
                int y2 = y_2;
                while(true){
                  if(x1<0 || x1>=h || y1<0 || y1>=w) break;
                  if(!st.count(make_pair(x1,y1))) sum += a[x1][y1];
                  st.emplace(x1,y1);
                  x1 += dx;
                  y1 += dy;
                }
                while(true){
                  if(x2<0 || x2>=h || y2<0 || y2>=w) break;
                  if(!st.count(make_pair(x2,y2))) sum += a[x2][y2];
                  st.emplace(x2,y2);
                  x2 += ex;
                  y2 += ey;
                }
                ans = max(ans, sum);
              }
            }
          }
        }
      }
    }
    cout << ans << endl;
    return 0;
}