#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())
#define sz(a) ((int)a.size())

#ifdef LOCAL
#define debug(x) do { cout << #x << ": " << x << endl; } while(0)
#define debug2(x, y) do { std::cerr << #x << ", " << #y << ": " << x << ", " << y << endl; } while (0)
#define debug3(x, y, z) do {std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << endl; } while(0)
#else
#define debug(x)
#define debug2(x, y) 
#define debug3(x, y, z) 
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
tcT> vector <T> presum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    FOR (i, a.size()) {
        p[i + 1] = p[i] + a[i];
    }   
    return p;
}
tcT> vector <T> sufsum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    for (int i = (int)a.size() - 1; i >= 0; --i) {
        p[i] = p[i + 1] + a[i];
    }
    return p;
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n, m;
    cin >> n >> m;
    vector <vector <int> > a(n, vector <int> (m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
        }
    }
    vector <vector <pair <int, int > > > l;
    for (int i = 0; i < n; ++i) {
        vector <pair <int, int > > nl;
        for (int j = 0; j < m; ++j) {
            nl.push_back({i,j});
        }
        l.push_back(nl);
    }

    for (int j = 0; j < m; ++j) {
        vector <pair <int, int > > nl;
        for (int i = 0; i < n; ++i) {
            nl.push_back({i,j});
        }
        l.push_back(nl);
    }

    for (int sum = 0; sum <= n + m; ++sum) {
        vector <pair <int, int > > nl;
        for (int i = 0; i < n; ++i) {
            int j = sum - i;
            if (0 <= j && j < m) {
                nl.push_back({i,j});
            }
        }
        l.push_back(nl);
    }

    for (int dif = -m; dif <= n; ++dif) {
        vector <pair <int, int > > nl;
        for (int i = 0; i < n; ++i) {
            int j = i - dif;
            if (0 <= j && j < m) {
                nl.push_back({i,j});
            }
        }
        l.push_back(nl);
    }

    for (auto &e : l) {
        sort(all(e));
    }
    int ans = 0;

    //cout << "ok" << endl;
    for (auto l1 : l) {
        for (auto l2 : l) {
            int ptr = 0;
            int sz = (int)l2.size();

            int sum = 0;
            for (auto p : l1) {
                sum += a[p.x][p.y];
            }
            for (auto p : l2) {
                sum += a[p.x][p.y];
            }

            for (auto p : l1) {
                while(ptr < sz && l2[ptr]<p) {
                    ptr++;
                }
                if (ptr<sz&&l2[ptr]==p) {
                    sum -= a[p.x][p.y];
                }
            }
            ckmax(ans,sum);
        }
    }
    cout<<ans<<endl;
}