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

ifstream fin ("flip.in");
ofstream fout ("flip.out");
int a[18], b[20][20], n, m;
long long s, smax, stot;
int main()
{
    int i, j;
    fin >> n >> m;
    for (i=1; i<=n; i++)
        for (j=1; j<=m; j++)
            fin >> b[i][j];
    smax=-1E9;
    while (a[m+1]==0)
    {
        stot=0;
        for (i=1; i<=n; i++)
        {
            s=0; /// suma pe linia i
            for (j=1; j<=m; j++)
                if (a[j]==1) s-=b[i][j];
                else s+=b[i][j];
            stot+=abs(s);
            smax=max(smax, stot);
        }
        for (i=1; a[i]; i++)
            a[i]=0;
        a[i]=1;
    }
    fout << smax;
    return 0;
}