#include<fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int a[30][30], b[21], i, j, n, m, maxim;
void bkt(int p)
{
	int maxim1, maxim2, s;
	maxim2=0;
    if(p-1==n)
    {
		for(j=1;j<=m;j++)
		{
			s=0;
			for(i=1;i<=n;i++)
				s=s+a[i][j]*b[i];
			maxim1=s;
			if(maxim1<0-s) maxim1=0-s;
            maxim2=maxim2+maxim1;
		}
		if (maxim<maxim2) maxim=maxim2;
		return;
	}
	b[p]=1;
	bkt(p+1);
	b[p]=-1;
	bkt(p+1);
}
				
int main(){
	in>>n>>m;
	maxim=-99999999;
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			in>>a[i][j];
	maxim=0;
	bkt(1);
	out<<maxim;
    return 0;
}