##### Baltic Olympiad in Informatics: 2009 Day 2, Problem 3

A Swedish millionaire wants to build a monument for her family. The names of all of her known ancestors (and later, her future descendants) will be inscribed to the sides of the monument. The form of the monument will be a rectangular block with bottom/top squares and height . That is, the bottom and top of the block will be squares, and each of the four sides of the monument is an rectangle. The values of and should be such that the four sides have as much space as possible, in order to fit as many names as possible.

The monument will be cut from a very special rectangular stone block that has been crystallised in a regular cubic form. That is, we may view the stone as being composed of unit blocks (unit cubes). Also, the final monument will be composed of such unit cubes. The raw stone may only be cut perpendicular to the x-, y- or z-axis, along the borders between unit cubes.

The raw stone contains pores, in the form of empty unit cubes. The monument is required to be of high quality and is thus not allowed to contain any pores (empty unit cubes). You are given a 3D-map of the raw stone. The map describes which unit cubes are normal and which empty. Your task is to find such values for the size parameters and of the monument such that:

it is possible to cut the monument out of the supplied raw stone block, and

the monument contains the maximal amount of space on its four sides, that is, the value is as large as possible.

#### Input Specification

The first line of input contains three positive space-separated integers: the values , and . This is followed by lines, each of which contains characters (and a new line character, no other white space). Each of the characters is either `N`

(normal) or `P`

(pore). The -th character on line corresponds to the unit cube with coordinates within the raw stone, where , and .

#### Output Specification

Output one integer on one line, containing the maximal value of .

#### Sample Input

```
3 2 5
PNNNN
PNNNN
NPPNP
PNNNP
NNNNP
PPNNP
```

#### Sample Output

`24`

#### Constraints

## Comments