#include <fstream>
#include <algorithm>
using namespace std;
 
ifstream is("flip.in");
ofstream os("flip.out");
 
long n, m,i,j,SMAX=-1,s;
long a[20][20];
void sum(int l,int c)
{
	int fl,fc,s2=0;
	for (fl=0;fl<n;fl++)
	s2=s2-a[fl][c];
	for (fc=0;fc<n;fc++)
	s2=s2-a[l][fc];
	s2*=2;
	s2+=s;
	if (s2>SMAX) SMAX=s2;
}

 
int main()
{
    is >> n >> m;
    for (i = 0; i <n; i++ )
        for (j = 0; j < m; j++ ){
            is >> a[i][j];
            s+=a[i][j];}
    for (i=0;i<n;i++)
    for (j=0;j<m;j++)
    sum(i,j);
    os << SMAX;
    is.close();
    os.close();
    return 0;
}