// #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 ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
// #define AMARI 1000000007
#define TIME_LIMIT 1980000
#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 + 2,vector<int>(w + 2,0));
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            cin >> a[i + 1][j + 1];
        }
    }
    vector<pii> v;
    for(int i = 0; i < h + 2; i++){
        v.push_back(pair(i,0));
        v.push_back(pair(i,w + 1));
    }
    for(int j = 0; j < w + 2; j++){
        v.push_back(pair(0,j));
        v.push_back(pair(h + 1,j));
    }
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    int m = v.size();
    int ans = 0;
    for(int i = 0; i < m; i++){
        for(int ix = -1; ix <= 1; ix++){
            for(int iy = -1; iy <= 1; iy++){
                if(ix == 0 && iy == 0)continue;
                if(v[i].first == 0 && ix == -1)continue;
                if(v[i].second == 0 && iy == -1)continue;
                if(v[i].first == h + 1 && ix == 1)continue;
                if(v[i].second == w + 1 && iy == 1)continue;
                vector<vector<bool>> vb(h + 2,vector<bool>(w + 2,false));
                int temp = 0;
                for(int l = 0; true; l++){
                    if(v[i].first + l * ix < 0)break;
                    if(v[i].first + l * ix >= h + 2)break;
                    if(v[i].second + l * iy < 0)break;
                    if(v[i].second + l * iy >= w + 2)break;
                    //cerr << v[i].first + l * ix << el;
                    //cerr << v[i].second + l * iy << el;
                    vb[v[i].first + l * ix][v[i].second + l * iy] = true;
                    temp += a[v[i].first + l * ix][v[i].second + l * iy];
                }

                for(int j = 0; j < i; j++){
                    for(int jx = -1; jx <= 1; jx++){
                        for(int jy = -1; jy <= 1; jy++){
                            if(jx == 0 && jy == 0)continue;
                            if(v[j].first == 0 && jx == -1)continue;
                            if(v[j].second == 0 && jy == -1)continue;
                            if(v[i].first == h + 1 && jx == 1)continue;
                            if(v[i].second == w + 1 && jy == 1)continue;
                            int temp2 = 0;
                            for(int l = 0; true; l++){
                                if(v[j].first + l * jx < 0)break;
                                if(v[j].first + l * jx >= h + 2)break;
                                if(v[j].second + l * jy < 0)break;
                                if(v[j].second + l * jy >= w + 2)break;
                                if(!vb[v[j].first + l * jx][v[j].second + l * jy])temp2 += a[v[j].first + l * jx][v[j].second + l * jy];
                            }
                            ans = max(ans,temp + temp2);
                        }
                    }
                }
            }
        }
    }
    cout << ans << el;
    return;
}

void calc(void) {
    return;
}

//WTFday1A
//ABC227D
//ECR156D
//ABC145E
//ABC325G
//ABC191C
//ABC191F

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;
}