#include <fstream>
#include <climits>
#define MAX_N 20

using namespace std;

ifstream f ("flip.in");
ofstream g("flip.out");

int n, m, v[MAX_N][MAX_N];
long long sol = LONG_MIN;

void read ()
{
    f >> n >> m;

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j ++)
            f >> v[i][j];
}

void solve ()
{
    for (int i = 0; i < (1 << m); i++)
    {
        long long sum1 = 0;
        for (int k = 1; k <= n; k++)
        {
            int s = 0;
            for(int j = 1; j <= m; j++)
                if(i & (1 << j))
                    s += - v[k][j];
                else
                    s += v[k][j];
            sum1 += abs(s);
        }
        if (sol < sum1) sol = sum1;
    }

    g << sol;
}

int main ()
{
    read();
    solve();
    return 0;
}