#include <iostream>
#include <fstream>

using namespace std;

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

int main() {
    int n, m, v[17][17];
    long long maxim = -2e18;

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

    for (int mask = 0; mask < (1 << n); mask++) {
        long long s_tabel = 0;

        for (int j = 1; j <= m; j++) {
            long long s_col = 0;
            for (int i = 1; i <= n; i++) {
                if ((mask >> (i - 1)) & 1) s_col -= v[i][j];
                else s_col += v[i][j];
            }

            if (s_col < 0) s_tabel -= s_col;
            else s_tabel += s_col;
        }

        if (s_tabel > maxim) maxim = s_tabel;
    }

    out << maxim << endl;
    return 0;
}