#include <fstream>

using namespace std;

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

long n,a[20][20],m,max1;
int i,j,k,s,t;

int main()
{f >> n >> m ;
    for ( i = 1 ; i <= n ; i ++ )
       for ( j = 1; j <= m ; j ++ )
         f >> a[i][j];
    for ( i = 1 ; i <= (1<<m) ; i ++ )
       {
           s=0;
            for ( k = 1 ; k <= n ; k ++ )
              {
                  for (j=1,t=0; j <= m ; j ++ )
                   {
                       if(i&(1<<j))
                    t+=-a[k][j];
                    else
                     t+=a[k][j];}
                     s+=t<-t?-t:t;
              }
            if(s > max1)
              max1=s;
       }
    g << max1;
    return 0;
}