#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

const int MAXN = 20;

int mat[MAXN][MAXN];
int sumaComutare[2 * MAXN];
vector<int> comutLin;
int n, m;
long long sumMax = -1e18, suma;

void flip(int pas, long long sum) {
    if (pas == n) {
        long long currentSum = sum;
        for (int j = n; j < n + m; ++j) {
            int colSum = sumaComutare[j];
            for (int i : comutLin)
                colSum -= 2 * mat[i][j - n];

            if (colSum < -colSum)
                currentSum += 2 * (-colSum);
        }
        if (sumMax < currentSum)
            sumMax = currentSum;
        return;
    }

    flip(pas + 1, sum);

    comutLin.push_back(pas);
    sumaComutare[pas] = -sumaComutare[pas];
    flip(pas + 1, sum + 2 * sumaComutare[pas]);
    sumaComutare[pas] = -sumaComutare[pas];
    comutLin.pop_back();
}

int main() {
    freopen("flip.in", "r", stdin);
    freopen("flip.out", "w", stdout);

    cin >> n >> m;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> mat[i][j];
            sumaComutare[i] += mat[i][j];
            suma += mat[i][j];
        }
    }

    for (int j = 0; j < m; ++j)
        for (int i = 0; i < n; ++i)
            sumaComutare[n + j] += mat[i][j];

    flip(0, suma);

    cout << sumMax;

    return 0;
}