#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

int main() {
    ifstream fin("flip.in");
    ofstream fout("flip.out");
    int n, m;
    fin >> n >> m;
    int t[n][m];
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) fin >> t[i][j];
    }
    int maxi = -99999;
    for (int i = 0; i < (1 << n); ++i) {
        int s[m + 1] = {0};
        for (int j = 0; j < n; ++j) {
            int p = ((i & (1 << j)) ? -1 : 1);
            for (int k = 0; k < m; ++k) s[k] += t[j][k] * p;
        }
        int curr = 0;
        for (int j = 0; j < m; ++j) {
            curr += max(s[j], -s[j]);
        }
        maxi = max(maxi, curr);
    }
    fout << maxi;
}