#include <stdlib.h>
#include <stdio.h>


int matrix_sum(int** matrix, int n, int m)
{
	int i, j, sum = 0;
	
	for (i = 0 ; i < n ; i++ )
		for (j = 0 ; j < m ; j++ )
			sum += matrix[i][j];
	return sum;
	
}

int flip_row(int** matrix, int n, int m, int sum, int r)
{
	int i;
	for (i = 0 ; i < m ; i++ )		
			sum -= 2 * matrix[r][i];
	return sum;	
}

int flip_col(int** matrix, int n, int m, int sum, int c)
{
	int i;	
	for (i = 0 ; i < n ; i++ )		
			sum -= 2 * matrix[i][c];
	return sum;	
}

int max (int a, int b)
{
	if (a > b)
		return a;
	return b;
}

int max_sum = 0;

void backtrack (int **matrix, int n, int m, int sum, int *v, int k)
{
	int i;
	if (k == n + m) {
		int tmp_sum = sum;
		for (i = 0 ; i < n ; i++ )
		{
			if (v[i] == 1)
				tmp_sum = flip_row(matrix, n, m, tmp_sum, i);
		}
		for (i = n ; i < n + m ; i++ )
		{
			if (v[i] == 1)
				tmp_sum = flip_col(matrix, n, m, tmp_sum, i - n);
		}
		max_sum = max(tmp_sum, max_sum);
	} else {
		for (i = 0 ; i < 2 ; i++ )
		{
			v[k] = i;
			backtrack(matrix, n, m, sum, v, k + 1);
		}
	}
}

int main(int argc, char** argv)
{
	int n, m, i, j, sum;
	int **matrix;
	int *c;
	
	FILE *in, *out;
	
	in = fopen("flip.in", "r");
	out = fopen("flip.out", "w");
	
	fscanf(in, "%d %d", &n, &m);
	
	matrix = malloc( n * sizeof( int* ) );
	for (i = 0 ; i < n ; i++ )
		matrix[i] = malloc( m * sizeof( int ) );
	
	for (i = 0 ; i < n ; i++ )
		for (j = 0 ; j < m ; j++ )
			fscanf(in, "%d", &matrix[i][j]);
	
	
	c = calloc( (n + m ), sizeof( int ) );

	
	sum = matrix_sum(matrix, n, m);
	
	backtrack(matrix, n, m, sum, c, 0);
	
	printf("%d\n", max_sum);
	fprintf(out, "%d", max_sum);
	
	fclose(in);
	fclose(out);
}