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

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

int n, m;
int a[20][20], x[20];
int aux, S, SMAX = -1;

void Sum();
void Flip( int k );

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

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

void Sum()
{
    S = 0;
    for ( int j = 1; j <= m; j++ )
    {
        aux = 0;
        for ( int i = 1; i <= n; i++ )
            aux += x[i] * a[i][j];
        S += abs(aux);
    }
    SMAX = max( SMAX, S );
}

void Flip( int k )
{
    if ( k > n )
    {
        Sum();
        return;
    }

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