#include <iostream>
#include <cmath>
#include <fstream>

using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");

int main()
{
    int n = 0, m = 0, V[16][16];
    f >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            f >> V[i][j];
        }
    }
    int maximGlobal = 0;
    for (int i = 0; i < (1 << n); i++) {
        int s = 0;
        for (int c = 0; c < m; c++) {
            int sumaC = 0;
            for (int l = 0; l < n; l++) {
                if ((i >> l) & 1 == 1) {
                    sumaC -= V[l][c];
                } else {
                    sumaC += V[l][c];
                }
            }
            s += abs(sumaC);
        }
        maximGlobal = max(maximGlobal, s);
    }
    g << maximGlobal;
    return 0;
}