We have a canvas represented as a grid with $H$ rows and $W$ columns. Let $(i, j)$ denote the square at the $i$\-th row from the top $(1 \leq i \leq H)$ and $j$\-th column from the left $(1 \leq j \leq W)$. Initially, $(i, j)$ is painted red if $s_{i, j}=$ `R` and blue if $s_{i, j}=$ `B`.
For any number of times, you can choose one of the two operations below and do it.
> **Operation X:** Choose a square painted red, and repaint all squares in the row containing that square (including itself) white.
> **Operation Y:** Choose a square painted red, and repaint all squares in the column containing that square (including itself) white.
Show one way that maximizes the number of squares painted white in the end.
## Constraints
* $1 \leq H \leq 2500$
* $1 \leq W \leq 2500$
* $s_{i, j}$ is `R` or `B`. $(1 \leq i \leq H, 1 \leq j \leq W)$
* $H$ and $W$ are integers.
## Input
Input is given from Standard Input in the following format:
$H$ $W$
$s_{1, 1}$$s_{1, 2}$$s_{1, 3}$$\cdots$$s_{1, W}$
$s_{2, 1}$$s_{2, 2}$$s_{2, 3}$$\cdots$$s_{2, W}$
$s_{3, 1}$$s_{3, 2}$$s_{3, 3}$$\cdots$$s_{3, W}$
$\vdots$
$s_{H, 1}$$s_{H, 2}$$s_{H, 3}$$\cdots$$s_{H, W}$
[samples]