#include <cstdio>
#include <algorithm>

using namespace std;

#define inf 1000000000
#define maxn 20

int n, m;
int sol, conf[maxn], l[maxn], v[maxn][maxn];

void back(int poz)
{
    if(poz==n+1)
    {
        int rez=0;

        for(int i=1; i<=m; ++i)
        {
            l[i]=0;
            for(int j=1; j<=n; ++j)
                l[i]+=v[j][i]*conf[j];
            rez+=max(l[i], -l[i]);
        }

        sol=max(sol, rez);
        return;
    }

    conf[poz]=-1;
    back(poz+1);

    conf[poz]=1;
    back(poz+1);
}

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", &v[i][j]);

    sol=-inf;
    back(1);

    printf("%d\n", sol);

    return 0;
}