Problem Statement

There are $H \times W$ cards on a grid of squares with $H$ rows and $W$ columns. For each pair of integers $(i, j)$ such that $1 \leq i \leq H, 1 \leq j \leq W$, the card at the $i$-th row and $j$-th column has an integer $A_{i, j}$ written on it.

Takahashi and Aoki will cooperate to play a game, which consists of the following steps.

• First, Takahashi chooses some of the $H$ rows (possibly none or all) and places a red token on each card in the chosen rows.
• Second, Aoki chooses some of the $W$ columns (possibly none or all) and places a blue token on each card in the chosen columns.
• Now, they compute their score as follows.
• If there is a card with a negative integer that has both red and blue tokens placed on it, the play is a "total failure"; the score is $-10^{100}$.
  • Otherwise, they collect all cards that have one or more tokens placed on them. The score is the sum of the integers written on the collected cards.

Find their maximum possible score.

Constraints

• $1 \leq H, W \leq 100$
• $-10^9 \leq A_{i, j} \leq 10^9$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

H W
A_{1, 1} A_{1, 2} \ldots A_{1, W}
A_{2, 1} A_{2, 2} \ldots A_{2, W}
\vdots
A_{H, 1} A_{H, 2} \ldots A_{H, W}

Output

Print the answer.