#include <fstream>
#define NMAX 17
#define INF 256 000 000
using namespace std;

int a[NMAX][NMAX];
int maxim = -INf;

void read() {
	ifstream in("flip.in");
	in>>n>>m;
}

void solve() {
	int lim = 1<<n;
	int flipped, notFlipped;
	int sum;
	for (int k = 0; k < lim; k++) {
		sum = 0;
		for (int i = 0; i < n; i++){
			flipped = 0;
			notFlipped = 0;
			for (int j = 0; j < m; j++)
				if (k & (1<<j)) {
					flipped += a[i][j];
					notFlipped -= a[i][j];
				} else {
					flipped -= a[i][j];
					notFlipped += a[i][j];
				}
			if (flipped >= notFlipped) {
				sum += flipped;
			} else {
				sum += notFlipped;
			}
		}
		if (maxim < sum) maxim = sum;
	}
}

int main() {
	ofstream out("flip.out");
	out<<max<<"\n";
	return 0;
}