#include <bits/stdc++.h>
using namespace std;
long long int sum(vector<long long int>& v, int num) {
  long long int res = 0;
  set<int> s;
  for (int i = 0; i < num; i++) {
    long long int ans = -2147483607, ind = 0;
    for (int j = 0; j < v.size(); j++) {
      if (v[j] > ans and s.find(j) == s.end()) {
        ans = v[j];
        ind = j;
      }
    }
    res += ans;
    s.insert(ind);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n, m;
  cin >> n >> m;
  vector<vector<int> > v;
  vector<int> t(max(n, m));
  v.resize(min(n, m), t);
  if (m < n) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) cin >> v[j][i];
    }
  } else {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) cin >> v[i][j];
    }
  }
  int x = min(m, n), y = max(m, n);
  n = x;
  m = y;
  if (n <= 4 or m <= 4) {
    long long int ans = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) ans += v[i][j];
    }
    cout << ans << endl;
  } else {
    vector<long long int> rows(n), columns(m);
    long long int ans = 0;
    for (int i = 0; i < n; i++) {
      long long int sum = 0;
      for (int j = 0; j < m; j++) sum += v[i][j];
      rows[i] = sum;
    }
    for (int i = 0; i < m; i++) {
      long long int sum = 0;
      for (int j = 0; j < n; j++) sum += v[j][i];
      columns[i] = sum;
    }
    long long int res = sum(rows, 4);
    ans = max(ans, res);
    res = sum(columns, 4);
    ans = max(ans, res);
    vector<long long int> dcolumns(m), drows(n);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) dcolumns[j] = columns[j] - v[i][j];
      res = sum(dcolumns, 3);
      ans = max(ans, res + rows[i]);
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        for (int k = 0; k < m; k++)
          dcolumns[k] = columns[k] - v[i][k] - v[j][k];
        res = sum(dcolumns, 2);
        ans = max(ans, res + rows[i] + rows[j]);
      }
    }
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < n; j++) drows[j] = rows[j] - v[j][i];
      res = sum(drows, 3);
      ans = max(ans, res + columns[i]);
    }
    cout << ans << endl;
  }
}
