#include <bits/stdc++.h>

using namespace std;

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

int n, m, mat[101][101], v[101], k, maxi;

int suma ()
{
    int s = 0;

    for (int i = 1; i <= n; i ++)
    {
        int lin = 0;
        for (int j = 1; j <= m; j ++)
        {
            if (v[j]) lin -= mat[i][j];
            else
                lin += mat[i][j];
        }
        s += abs(lin);
    }
    return s;
}

int main()
{
    fin >> n >> m;

    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j ++)
            fin >> mat[i][j];

    while (!v[0])
    {
        int i = m;
        while (v[i]) v[i] = 0, i --;
        v[i] ++;

        int s = suma();

        if (s > maxi) maxi = s;
    }

    fout << maxi;

    return 0;
}