#include <fstream>
#include <algorithm>
using namespace std;
int main()
{ int v[100][16],i,k,j,m,n,S=0,S1=0;
  long long u[100];
  ifstream cin("flip.in");
  ofstream cout("flip.out");
  cin>>n>>m;
  for(i=1;i<=n;i++)
	  for(j=1;j<=m;j++)
		 { cin>>v[i][j];
		  S+=v[i][j]; }
	  k=1;
	  u[k]=S;
  for(i=1;i<=n;i++)
       for(j=1;j<=m;j++)
		{  v[i][j]=v[1][j]*(-1);
	      S1+=v[i][j];
		  k++;
		  u[k]=S1; }
  sort(u+1,u+k+1);
  cout<<u[k];
  cin.close();
  cout.close();
  return 0;
}