#include <fstream>

using namespace std;

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

const int max_size = 17, INF = 2e9 + 1;

long long coef[max_size], a[max_size][max_size], n, m, ans;

void solve ()
{
    long long rez = 0;
    for (int i = 1; i <= n; i++)
    {
        long long suml = 0;
        for (int j = 1; j <= m; j++)
        {
            suml += a[i][j] * coef[j];
        }
        if (suml < 0)
        {
            suml = -suml;
        }
        rez += suml;
    }
    ans = max(ans, rez);
}

void bkt (int col)
{
    if (col > m)
    {
        solve();
    }
    else
    {
        coef[col] = 1;
        bkt(col + 1);
        coef[col] = -1;
        bkt(col + 1);
    }
}

int main ()
{
    ans = -INF;
    in >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            in >> a[i][j];
        }
    }
    bkt(1);
    out << ans;
    in.close();
    out.close();
    return 0;
}