#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long n,m,l[40],x,f[30],v[17][17];
int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
        {
            fin>>v[i][j];
        }
    int mx=0;
    for (int i=1;i<=(1<<(n+m))-1;i++)
    {
        int j=0;
        while (f[++j]!=0 && j<=n+m) f[j]=0;
        f[j]=1;
        int s=0;
        for (int j=1;j<=n;j++)
            for (int k=1;k<=m;k++)
        {
            if (f[j]+f[n+k]==1) s-=v[j][k];
                else s+=v[j][k];
        }
        if (s>mx) mx=s;
    }
    fout<<mx;
    return 0;
}