#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<long long> > a;
long long ans = 0;
priority_queue<long long> h;
vector<long long> C, R;
void mem() {
  while (!h.empty()) h.pop();
}
int main() {
  cin >> n >> m;
  a.resize(n + 10);
  C.resize(m + 10);
  R.resize(n + 10);
  for (int i = 1; i <= n; i++) {
    a[i].push_back(0);
    for (int j = 1; j <= m; j++) {
      int x;
      cin >> x;
      a[i].push_back(x);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      R[i] += a[i][j];
    }
  }
  for (int j = 1; j <= m; j++) {
    for (int i = 1; i <= n; i++) C[j] += a[i][j];
  }
  vector<long long> x = R;
  sort(x.begin(), x.end(), greater<long long>());
  ans = max(ans, x[0] + x[1] + x[2] + x[3]);
  x = C;
  sort(x.begin(), x.end(), greater<long long>());
  ans = max(ans, x[0] + x[1] + x[2] + x[3]);
  for (int i = 1; i <= n; i++) {
    vector<long long> x = C;
    for (int j = 1; j <= m; j++) {
      x[j] -= a[i][j];
    }
    sort(x.begin(), x.end(), greater<long long>());
    ans = max(ans, R[i] + x[1] + x[2] + x[0]);
  }
  for (int j = 1; j <= m; j++) {
    vector<long long> x = R;
    for (int i = 1; i <= n; i++) {
      x[i] -= a[i][j];
    }
    sort(x.begin(), x.end(), greater<long long>());
    ans = max(ans, C[j] + x[1] + x[2] + x[0]);
  }
  if (n <= m) {
    for (int i = 1; i <= n; i++) {
      for (int j = i + 1; j <= n; j++) {
        vector<long long> x = C;
        for (int k = 1; k <= m; k++) x[k] -= a[i][k] + a[j][k];
        long long Max1 = 0, Max2 = 0;
        for (auto val : x) {
          if (val > Max1) {
            Max2 = Max1;
            Max1 = val;
          } else if (val > Max2) {
            Max2 = val;
          }
        }
        ans = max(ans, R[i] + R[j] + Max1 + Max2);
      }
    }
  } else {
    for (int i = 1; i <= m; i++) {
      for (int j = i + 1; j <= m; j++) {
        vector<long long> x = R;
        for (int k = 1; k <= n; k++) {
          x[k] -= a[k][i] + a[k][j];
        }
        long long Max1 = 0, Max2 = 0;
        for (auto val : x) {
          if (val > Max1) {
            Max2 = Max1;
            Max1 = val;
          } else if (val > Max2) {
            Max2 = val;
          }
        }
        ans = max(ans, R[j] + R[i] + Max1 + Max2);
      }
    }
  }
  cout << ans;
  return 0;
}
