#include <stdio.h>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <algorithm>
#include <deque>
#define nmax 18
using namespace std;
int i,j,k,n,m,t[nmax][nmax],sum,sol=-99395960,curentsol;
int main(){
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
   for (j=1;j<=m;j++)
       scanf("%d",&t[i][j]);
for (i=0;i<(1<<m);i++){
    curentsol=0;
    for (j=1;j<=n;j++){
        sum=0;
        for (k=1;k<=m;k++)
            if ((i>>(k-1))&1!=0) sum=sum+t[j][k]; else
               sum=sum-t[j][k];
        if (sum<0) sum=-sum;
        curentsol=curentsol+sum;
    }
    sol=max(sol,curentsol);
}
printf("%d",sol);
return 0;
}