#include <fstream>
#include <algorithm>
using namespace std;

ifstream is("flip.in");
ofstream os("flip.out");

int a[20][20], aux[20][20], x[20];
int n, m;
int s, sum, smax = -1;

void Backtrack(int k);
void Write(int k);
void Suma();

int main()
{
    is >> n >> m;
    for ( int i = 1; i <= n; ++i )
        for ( int j = 1; j <= m; ++j )
            is >> a[i][j];

    Backtrack(1);

    os << smax;

    is.close();
    os.close();
    return 0;
}

void Backtrack(int k)
{
    if ( k > n )
    {
        Suma();
        return;
    }

    for ( int i = -1; i <= 1; ++i )
    {
        x[k] = i;
        if ( x[k] != 0 )
            Backtrack(k+1);
    }
}

void Suma()
{
    sum = 0;
    for ( int j = 1; j <= m; ++j )
    {
        s = 0;
        for ( int i = 1; i <= n; ++i )
            s += x[i]*a[i][j];
        sum += abs(s);
    }
    smax = max(smax, sum);
}