#include #include #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)n-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair; using pll=pair; using pdd=pair; using tp=tuple; using tpll=tuple; using veci=vector; using vecpii=vector>; using vecll=vector; using vecpll=vector>; using vecpdd=vector>; using vecs=vector; using vecb=vector; using vecd=vector; using vectp=vector; using vectpll=vector; using mint=modint998244353; using mint10=modint1000000007; template istream& operator>>(istream& in, pair& a){return in >> a.first >> a.second;} template ostream& operator<<(ostream& out, const pair& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template ostream& operator<<(ostream& out, const vector& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template pair operator+(const pair& a, const pair& b){return {a.fi + b.fi, a.se + b.se};} template pair operator-(const pair& a, const pair& b){return {a.fi - b.fi, a.se - b.se};} template inline bool chmax(T& a,T b){if(a inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} constexpr ll INF=numeric_limits::max() / 4; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template void LogOutput(vector>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int h, w;cin>>h>>w; vector a(h, veci(w)); rep(i, h) rep(j, w) cin>>a[i][j]; vecll s(h, 0), s2(w, 0), s3(h + w - 1, 0), s4(h + w - 1, 0); rep(i, h) rep(j, w){ s[i] += a[i][j]; s2[j] += a[i][j]; s3[h - i - 1 + j] += a[i][j]; s4[h - i - 1 + w - j - 1] += a[i][j]; } ll ans = 0; rep(i, h){ rep(j, h) if(i != j) chmax(ans, s[i] + s[j]); rep(j, w) chmax(ans, s[i] + s2[j] - a[i][j]); int v = -(h - i - 1), v2 = w - 1 + h - 1 - i; rep(j, h + w - 1){ chmax(ans, s[i] + s3[j] - (v >= 0 && v < w ? a[i][v] : 0)); chmax(ans, s[i] + s4[j] - (v2 >= 0 && v2 < w ? a[i][v2] : 0)); v++; v2--; } } rep(i, w){ rep(j, w) if(i != j) chmax(ans, s2[i] + s2[j]); int v = h - 1 + i, v2 = w - 1 - i + h - 1; rep(j, h + w - 1){ chmax(ans, s2[i] + s3[j] - (v >= 0 && v < h ? a[v][i] : 0)); chmax(ans, s2[i] + s4[j] - (v2 >= 0 && v2 < h ? a[v2][i] : 0)); v--; v2--; } } int vi = h - 1 + w / 2, vj = w / 2; rep(i, h + w - 1){ rep(j, h + w - 1) if(i != j) chmax(ans, s3[i] + s3[j]); rep(j, h + w - 1) if(i != j) chmax(ans, s4[i] + s4[j]); chmax(ans, s3[i] + s4[i] - (w % 2 && vi >= 0 && vi < h ? a[vi][vj] : 0)); vi--; } cout<