#include <cstdio>
#include <algorithm>
#include <cstdlib>
#define MAX 25
using namespace std;
void bkt(int k);
void solve();
int sol[MAX],mat[MAX][MAX],maximum,n,m;
int main()
{
    freopen("flip.in","r",stdin);
    freopen("flip.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)
            scanf("%d",mat[i]+j);
    bkt(1);
    printf("%d\n",maximum);
    return 0;
}
void bkt(int k)
{
    for(int i=-1;i<=1;i+=2){
        sol[k]=i;
        if(k==m+1){
            solve();
            return;
        }
        bkt(k+1);
    }
}
void solve(){
    int total=0,s;
    for(int i=1;i<=n;++i){
        s=0;
        for(int j=1;j<=m;++j){
            s+=mat[i][j]*sol[j];
        }
        if(s<0)total+=abs(s);
        else total+=s;
    }
    maximum=max(total,maximum);
}