#include <bits/stdc++.h>
using namespace std;
long long int pow1(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  if (b % 2) return pow1(a, b / 2) * pow1(a, b / 2) * a;
  return pow1(a, b / 2) * pow1(a, b / 2);
}
int main() {
  long long int n, m;
  cin >> n >> m;
  long long int a[n][m];
  vector<long long int> row(n, 0), col(m, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
      row[i] += a[i][j];
      col[j] += a[i][j];
    }
  }
  vector<long long int> arr[m];
  vector<long long int> arr1[n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      arr[j].push_back(row[i] - a[i][j]);
      arr1[i].push_back(col[j] - a[i][j]);
    }
  }
  for (int j = 0; j < m; j++) sort(arr[j].begin(), arr[j].end());
  for (int i = 0; i < n; i++) sort(arr1[i].begin(), arr1[i].end());
  long long int ans = 0;
  vector<long long int> row1 = row;
  vector<long long int> col1 = col;
  sort(row.begin(), row.end());
  sort(col.begin(), col.end());
  for (int i = row.size() - 1; i >= 0 && i > row.size() - 5; i--)
    ans = ans + row[i];
  long long int ans1 = 0;
  for (int i = col.size() - 1; i >= 0 && i > col.size() - 5; i--)
    ans1 += col[i];
  ans = max(ans1, ans);
  for (int j = 0; j < m; j++) {
    ans1 = 0;
    for (int i = arr[j].size() - 1; i > arr[j].size() - 4 && i >= 0; i--)
      ans1 += arr[j][i];
    ans = max(ans1 + col1[j], ans);
  }
  for (int i = 0; i < n; i++) {
    ans1 = 0;
    for (int j = arr1[i].size() - 1; j > arr1[i].size() - 4 && j >= 0; j--)
      ans1 += arr1[i][j];
    ans = max(ans, row1[i] + ans1);
  }
  if (n * n <= 1e5) {
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        long long int max1 = 0;
        for (int k = 0; k < m; k++)
          max1 = max(max1, col1[k] - a[i][k] - a[j][k]);
        long long int max2 = 0;
        for (int k = 0; k < m; k++)
          if (max1 != col1[k] - a[i][k] - a[j][k])
            max2 = max(max2, col1[k] - a[i][k] - a[j][k]);
        ans = max(ans, max1 + max2 + row1[i] + row1[j]);
      }
    }
  } else {
    for (int i = 0; i < m; i++) {
      for (int j = i + 1; j < m; j++) {
        long long int max1 = 0;
        for (int k = 0; k < n; k++)
          max1 = max(max1, row1[k] - a[k][i] - a[k][j]);
        long long int max2 = 0;
        for (int k = 0; k < n; k++)
          if (max1 != row1[k] - a[k][i] - a[k][j])
            max2 = max(max2, row1[k] - a[k][i] - a[k][j]);
        ans = max(ans, max1 + max2 + col1[i] + col1[j]);
      }
    }
  }
  cout << ans << endl;
  return 0;
}
