#include <bits/stdc++.h>

using namespace std;

ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, k, a[22][22], r;

int main() {
    fin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) fin >> a[i][j];
    }

    int p = (1 << m);
    for(k = 1; k < p; k++) {
        int sum = 0;

        for(int i = 1; i <= n; i++) {
            int s = 0;

            for(int j = 0; j < m; j++) {
                if(1 & (k >> j)) s += a[i][j + 1];
                else             s -= a[i][j + 1];
            }

            if(s < 0) s *= -1;
            sum += s;
        }
        r = max(r, sum);
    }
    fout << r;

    return 0;
}