#include <fstream>
#include <cmath>

using namespace std;

ifstream cin("flip.in");
ofstream cout("flip.out");

int a[20][20];
int n, m;

long long maxSum = 0;

short flip[20];

void make_sum()
{
    long long sum = 0;
    for (int j = 1; j <= m; j++)
    {
        long long linSum = 0;
        for (int i = 1; i <= n; i++)
            linSum += a[i][j] * flip[i];
        sum += abs(linSum);
    }
    maxSum = max(maxSum, sum);
}

void backtrack(int stage)
{
    if (stage <= n)
    {
        flip[stage] = 1;
        backtrack(stage + 1);
        flip[stage] = -1;
        backtrack(stage + 1);
    }
    else make_sum();
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    backtrack(1);
    cout << maxSum;
}