#include <stdio.h>
//#include <string.h>
//fa combinatii de n luate cate k [0 la 16*2 -1]

int matrix[16][16];
int mat[16][16];
int v[32];
int n, m;
int maxim;

void max_matrix(int k)
{
    int i, j, s1=0;

    //memcpy(mat, matrix, sizeof(mat));

    for (i=0; i<k; i++)
        if(v[i]<=n)
        {
            for (j=0; j<m; j++)
                matrix[v[i]-1][j]*=-1;
        }
        else
        {
            for (j=0; j<n; j++)
                matrix[j][v[i]-n-1]*=-1;
        }

    for(i=0; i<n; i++)
        for(j=0; j<m; j++)
            s1+=matrix[i][j];

    if(s1>maxim) maxim = s1;

    for (i=k-1; i>=0; i--)
        if(v[i]<=n)
        {
            for (j=0; j<m; j++)
                matrix[v[i]-1][j]*=-1;
        }
        else
        {
            for (j=0; j<n; j++)
                matrix[j][v[i]-n-1]*=-1;
        }

}

void combinari(int n, int k, int i, int r)
{
    int j;

    if(i==k)
    {
        max_matrix(k);
        return;
    }

    for(j=r; j<=n; j++)
    {
        v[i]=j;
        combinari(n, k, i+1, j+1);
    }

}


int main ()
{
    int i, j;

    FILE *fi, *fo;
    fi=fopen("flip.in","r");
    fo=fopen("flip.out","w");

    fscanf(fi,"%d %d", &n, &m);

    for(i=0; i<n; i++)
        for(j=0; j<m; j++)
            fscanf(fi,"%d", &matrix[i][j]);

    for(i=1; i<n+m; i++)
        combinari(n+m, i, 0, 1);

    //printf("%d", maxim);
    fprintf(fo,"%d", maxim);

    //fclose(fi);
    fclose(fo);
}