#include    <iostream>
#include    <fstream>
#include    <queue>
#include    <climits>
#define nm 52
using namespace std;

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

int ma[nm][nm],n,m,s;
int ma1=-INT_MAX,s1,ma2=-INT_MAX,p,p1,ma3[nm][nm],sf;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++){
          fin>>ma[i][j],ma3[i][j]=ma[i][j];
          //s+=ma[i][j];
        }
    for(int i=1;i<=n;i++){
        s=0;
        for(int j=1;j<=m;j++){
          ma[i][j]*=-1;
          s+=ma[i][j];
          if(s>ma1)
            ma1=s,p=i;
      }
    }
    for(int j=1;j<=m;j++){
        s1=0;
        for(int i=1;i<=n;i++){
          ma[i][j]*=-1;
          s1+=ma[i][j];
          if(s1>ma2)
            ma2=s1,p1=j;
          }
    }
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++){
        if(i==p)
        ma3[i][j]*=-1;
        if(j==p1+1)
        ma3[i][j]*=-1;
        }
    ///s1=0;
        ma3[p][p1+1]*=-1;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
           sf+=ma3[i][j];
    fout<<sf;
}