#include <bits/stdc++.h>

using namespace std;

int n, m, v[16][16];

int main() {
#ifdef INFOARENA
	freopen ("flip.in", "r", stdin);
	freopen ("flip.out", "w", stdout);
#endif
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> v[i][j];
		}
	}
	int best = -1;
	for (int mask = 0; mask < (1 << m); mask++) {
		int now = 0;
		for (int i = 0; i < n; i++) {
			int s = 0;
			for (int j = 0; j < m; j++) {
				if (mask & (1 << j)) {
					s += v[i][j]; 
				} else {
					s -= v[i][j];
				}
			}
			now += abs(s);
		}
		best = max(best, now);
	}
	cout << best << "\n";
	return 0;
}