#include <iostream>
#include <fstream>


using namespace std;

int n, m;
long int a[16][16];

long int mx = -16000000;

int lc[32] = {-1,-1,-1,-1,-1,-1,-1,-1,
              -1,-1,-1,-1,-1,-1,-1,-1,
              -1,-1,-1,-1,-1,-1,-1,-1,
              -1,-1,-1,-1,-1,-1,-1,-1};

long int calcSum()
{
    long int s = 0;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            s+=a[i][j] * lc[i] * lc[n+j];
    return s;
}

void subset(int* v, int l)
{
    int i = l-1;
    int step = 0;

    mx = max(mx, calcSum());

    do{
        if(v[i] == -1)
        {
            v[i] = 1;
            i = l-1;
            step++;

            mx = max(mx, calcSum());

        }
        else
        if(v[i] == 1)
        {
            v[i] = -1;
            i--;
        }
    }while(step < (1 << l)-1);
}

int main()
{
    ifstream f("flip.in");
    ofstream g("flip.out");

    f >> n >> m;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            f >> a[i][j];

    subset(lc, m+n);


    g << mx;


    return 0;
}