#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#define N 20

using namespace std;

int n, m, a[N][N], v[N], i, j, sol;

void back(int k)
{
    int i, j, sum, sp;
    if(k==m+1)
    {
        sum = 0;
        for(i=1;i<=n;i++)
        {
            sp = 0;
            for(j=1;j<=m;j++)
            {
                sp+=a[i][j]*v[j];
            }
            sum+=((sp<0)?-sp:sp);
        }
        sol=max(sol, sum);
    } else {
        v[k] = 1;
        back(k+1);
        v[k] = -1;
        back(k+1);
    }
}

int main()
{
    freopen("flip.in", "r", stdin);
    freopen("flip.out", "w", stdout);

    scanf("%d%d", &n, &m);

    memset(v, 1, N);

    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            scanf("%d", &a[i][j]);

    back(1);

    printf("%d", sol);


    return 0;
}