#include <bits/stdc++.h>

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

int a[20][20], base[20], n, m;

void Citire()
{
    int i, j;
    fin >> n >> m;
    for (i=1; i<=n; i++)
        for (j=1; j<=m; j++)
            fin >> a[i][j];
}

void Rezolvare()
{
    int suma, scol, total=0, i, j;

    while (!base[0])
    {
        i=m;
        while (base[i]==1)
        {
            base[i]=0;
            i--;
        }
        base[i]=1;
        suma=0;

        for (i=1; i<=n; i++)
        {
            scol=0;
            for (j=1; j<=m; j++)
                if (base[j]==1)
                    scol+=a[i][j];
                else
                    scol-=a[i][j];
            if (scol<0)
                scol=-scol;
            suma+=scol;
        }
        total=max(total, suma);
    }
    fout << total << "\n";
}

int main()
{
    Citire();
    Rezolvare();
    fin.close();
    fout.close();
    return 0;
}