#include<stdio.h>
#define BIT(1<<(k))
#define max(a, b) (a>b?a:b)
using namespace std;

int n, m, tabla[20][20];
int scol[20], s, smax = -1000000000;

int main(void){
    freopen("flip.in" , "r", stdin );
    freopen("flip.out", "w", stdout);
    scan("%d%d", &n, &m);
    for(int i = 0; i < n, i++){
        for(int i = 0; i < m, i++){
            scanf("%d", tabla[n][m]);
        }
    }
    for(int p = 0; p < BIT(n); p++){
        s = 0;
        for(int j = 0; j < m; j++){
            scol[j] = 0;
            for(int i = 0; i < n; i++){
                if((c & BIT(I)) != 0){
                    s -= tabla[i][j];
                    scol[j] -= tabla[i][j];
                }else{
                     s += tabla[i][j];
                    scol[j] += tabla[i][j];
                }
            }
        }
        for(int j = 0; j < m; j++){
            if(scol[j] < 0){
                sc -= 2* scol[j];
            }
            smax = max(smax, s);
        }
    }
    return 0;
}