#include <bits/stdc++.h>
using namespace std;
#define int long long
const int NMAX = 230;

int x[NMAX], n, m, maxim = LONG_MIN;
int a[NMAX][NMAX];

void backtrack(int pas){
    if(pas == m + 1){
        int suma =0 ;
        for(int i= 1;i <= n;i++){
            int s = 0;
            for(int j = 1;j <= m;j++){
                int elem = a[i][j];
                if(x[j] == 1){
                    elem = -elem;
                }
                s += elem;
            }
            s = abs(s);
            suma += s;
        }
        maxim = max(maxim, suma);
    }else{
        for(int i= 0; i <= 1;i++){
            x[pas] = i;
            backtrack(pas + 1);
        }
    }
}

int32_t main(void){
    ofstream cout("flip.out");
    ifstream cin("flip.in");
    cin >> n >> m;
    for(int i =1;i <=n ;i++){
        for(int j = 1;j <= m;j++){
            cin >> a[i][j];
        }
    }
    backtrack(1);
    cout << maxim;
}