#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("flip.in");
ofstream fout("flip.out");

int main() {
    int n, m;
    fin >> n >> m;
    long long sum = 0;
    int a[17][17];
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            fin >> a[i][j];
            sum += a[i][j];
        }
    }
    long long max_sum = sum;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            long long current_sum = sum;
            for(int k = 0; k < n; ++k) {
                if(k != i) {
                    current_sum -= 2 * a[k][j]; 
                }
            }
            for(int k = 0; k < m; ++k) {
                if(k != j) {
                    current_sum -= 2 * a[i][k]; 
                }
            }
            max_sum = max(max_sum, current_sum);
        }
    }

    fout << max_sum << endl;
    fin.close();
    fout.close();
    
    return 0;
}