#include <fstream>
#include <bitset>
using namespace std;
ifstream cin("flip.in");
ofstream cout("flip.out");
int a[20][20], n, m, maxi = -1;
int main()
{
    cin >> n >> m;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin >> a[i][j];
    int sbm = (1 << m);
    for(int cnt =1; cnt < sbm; cnt++)
    {
        bitset <20> biti(cnt);
        int s = 0;
        for(int i=1; i<=n; i++)
        {
            int sum = 0;
            for(int j=1; j<=m; j++)
                if(biti[j-1] & 1)
                    sum -= a[i][j];
                else
                    sum += a[i][j];
            s += abs(sum);
        }
        maxi = max(maxi, s);

    }
    cout << maxi;
    return 0;
}