#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 20;
int v[N][N];

int main()
{
    long long int afis = 0, sum = 0, s = 0, putere = 0;
    int n, m, i, j;
    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", &v[i][j]);
        }
    }
    for(putere = 0;putere < (1 << m); ++putere)
    {
        sum = 0;
        for(i = 1;i <= n; ++i)
        {
            s = 0;
            for(j = 1;j <= m; ++j)
            {
                if(putere & (1 << j))
                {
                    s += v[i][j];
                }
                else
                {
                    s -= v[i][j];
                }
            }
            sum = max(sum + s , sum - s);
        }
        afis = max(afis , sum);
    }
    printf("%lld\n",afis);
    return 0;
}