#include <fstream>

using namespace std;

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

const int nmax = 16;
int n, m, a[nmax + 2][nmax + 2];
int bestt = -(1 << 30);

int myabs(int x){ return ((x < 0) ? -x : x); }

int solve(int msk){
    int rowsum = 0, summ = 0;
    for(int i = 1; i <= n; i++){
        rowsum = 0;
        for(int j = 1; j <= m; j++)
            rowsum += a[i][j] * ((msk & (1 << (j - 1))) ? -1 : 1);

        summ += myabs(rowsum);
    }
    return summ;
}

int main(){

    in>>n>>m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++)
            in>>a[i][j];
    }

    for(int mask = 0; mask < (1 << m); mask++)
        bestt = max(bestt, solve(mask));
    out<<bestt<<"\n";

    return 0;
}