#include<cstdio>

int max,m,n;
bool sol[20];
int a[18][18];

void prelucrare()
{
	int sum,s,i,j;
	sum=0;
	for(j=1;j<=m;j++)
	{
		s=0;
		for(i=1;i<=n;i++)
			if(sol[i])
				s-=a[i][j];
			else
				s+=a[i][j];
		if(s<0)
			s=-s;
		sum+=s;
	}
	if(sum>max)
		max=sum;
}

void bkt(int p)
{
	if(p==n+1)
	{
		prelucrare();
		return;
	}
	sol[p]=false;
	bkt(p+1);
	sol[p]=true;
	bkt(p+1);
}

int main()
{
	freopen("flip.in","r",stdin);
	freopen("flip.out","w",stdout);
	int i,j;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			scanf("%d",&a[i][j]);
	bkt(1);
	printf("%d",max);
	return 0;
}