Description

A box is divided into grids with $H$ rows and $W$ columns. Some squares contain strawberries.

The state of the box is denoted by $S$, and $S_{x,y} = 1$ means that the square in the $x$-th row and $y$-th column contains one strawberry. If $S_{x,y} = 0$, the square in the $x$-th row and $y$-th column is empty.

Tomoe devised the following method to distinguish between these strawberries.

• Let $A_{x,y}$ be defined as the sum of $S_{i,j}$ for all integer pairs $(i,j)$ satisfying $i = x, 1 \leq j \leq y$.
• Let $B_{x,y}$ be defined as the sum of $S_{i,j}$ for all integer pairs $(i,j)$ satisfying $1 \leq i \leq x, j = y$.
• If the square in the $x$-th row and $y$-th column contains a strawberry, label the strawberry with the tuple $(A_{x,y}, B_{x,y})$.

This method could result in multiple strawberries having the same label, and the strawberries could not be distinguished. Therefore, she decided to add some strawberries before labeling them.

More formally, for $(x,y)$ such that $S_{x,y} = 0$, we operated $S_{x,y} \leftarrow 1$ any number of times greater than $0$.

What is the minimum number of strawberries that must be added to label all the strawberries differently?

Input Format

$$\begin{aligned} &H \ W \\ &S_{1,1} \ S_{1,2} \ \ldots \ S_{1,W} \\ &S_{2,1} \ S_{2,2} \ \ldots \ S_{2,W} \\ &\vdots \\ &S_{H,1} \ S_{H,2} \ \ldots \ S_{H,W} \end{aligned}$$

The input satisfies the following constraints.

• All inputs consist of integers.
• $1 \leq H \leq 300$
• $1 \leq W \leq 300$
• $0 \leq S_{x,y} \leq 1$

Output Format

Output the answer in one line. Add a new line at the end of the output.

3 2
1 0
0 1
0 1

1

4 4
0 1 1 1
1 1 1 0
1 0 1 1
1 0 1 0

2

5 5
0 0 1 0 1
0 1 0 1 0
0 0 1 0 1
0 1 0 1 0
0 0 1 0 1

8

1 1
0

0

Hint

In Sample Input 1, Tomoe can achieve the condition by placing a strawberry in the upper right square.