#include <bits/stdc++.h>
using namespace std;

ifstream fin("flip.in");
ofstream fout("flip.out");

long long smax;
int n, m, semn[20], a[20][20];

void bkt(int k) {
    if(k == n + 1) {
        long long suma_finala = 0;
        for(int i = 1; i <= m; i++) {
            long long sum = 0;
            for(int j = 1; j <= n; j++)
                sum += a[j][i] * semn[j];

            if(sum < 0) suma_finala += sum * (-1);
            else suma_finala += sum;
        }

        smax = max(smax, suma_finala);
        return;
    }

    semn[k] = -1;
    bkt(k + 1);
    semn[k] = 1;
    bkt(k+1);
}

int main() {

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

    bkt(1);
    fout << smax << "\n";

    return 0;
}