#include <fstream>
#include <algorithm>

using namespace std;

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

int n,m,v[20][20],i,j,s,val,subsecv,a[20],x,o,sum,maxim;

int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            f>>v[i][j];
    val=(1<<m);
    for(subsecv=1;subsecv<=val;subsecv++)
    {
        x=subsecv;
        o=0;
        for(i=1;i<=m;i++)
            a[i]=0;
        while(x!=0)
        {
            o++;
            a[o]=x%2;
            x=x/2;
        }
        sum=0;
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=1;j<=m;j++)
                if(a[j]==0)
                    s=s+v[i][j];
                else
                    s=s-v[i][j];
            if(s<0)
                s=0-s;
            sum=sum+s;
        }
        maxim=max(maxim,sum);
    }
    g<<maxim;
    f.close();
    g.close();
    return 0;
}