#include <bits/stdc++.h>

using namespace std;

const int maxN = 20;

int n, m;

int maxSum;

int a[maxN + 5][maxN + 5];

int s[maxN + 5];

void bkt(int p) {
  for (int take : {-1, 1}) {
    for (int j = 1; j <= m; j++) {
      s[j] += take * 2 * a[p][j];
    }
    if (p == n) {
      int sum = 0;
      for (int j = 1; j <= m; j++) {
        sum += abs(s[j]);
      }
      maxSum = max(maxSum, sum);
    } else {
      bkt(p + 1);
    }
  }
}

int main() {
  freopen("flip.in", "r", stdin);
  freopen("flip.out", "w", stdout);
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      scanf("%d", &a[i][j]);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      s[j] += a[i][j];
    }
  }
  bkt(1);
  printf("%d\n", maxSum);
  return 0;
}