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

int main()
{
    ifstream f("flip.in");
    ofstream g("flip.out");
    int N, M;
    f >> N >> M;
    int T[N][M], sum = 0;
    for (int i = 0; i < N; ++i)
        for (int j = 0; j < M; ++j)
            f >> T[i][j];

    for (int i = 0; i < N; ++i)
    {
        int max_row = 0;
        int sum_row = 0;
        for (int j = 0; j < M; ++j)
        {
            sum_row += T[i][j];
            max_row = max(max_row, T[i][j]);
        }
        sum += (sum_row > 0) ? sum_row : max_row;
    }

    for (int j = 0; j < M; ++j)
    {
        int max_column = 0;
        int sum_column = 0;
        for (int i = 0; i < N; ++i)
        {
            sum_column += T[i][j];
            max_column = max(max_column, T[i][j]);
        }
        sum += (sum_column > 0) ? sum_column : max_column;
    }

    g << sum;

    f.close();
    g.close();

    return 0;
}