题目描述

The Queen of Icpca resides in a castle peacefully. One day, she heard that many secret agents had been active in other nations, and got worried about the security of the castle.

The castle has a rectangular dungeon consisting of $h$ rows of $w$ square rooms. Adjacent rooms are separated by a wall. Some walls have doorways making the separated rooms intercommunicate. The entrance and the exit of the dungeon are in the rooms located at two diagonal extreme corners. The dungeon rooms form a tree, that is, the exit room is reachable from every room in the dungeon through a unique route that passes all the rooms on the route only once.

In order to enhance the security of the castle, the Queen wants to remodel the dungeon so that the number of rooms on the route from the entrance room to the exit room is maximized. She likes the tree property of the current dungeon, so it must be preserved. Due to the cost limitation, what can be done in the remodeling is to block one doorway to make it unavailable and to construct one new doorway instead on a wall (possibly on the same wall).

Your mission is to find a way to remodel the dungeon as the Queen wants.

输入格式

The input consists of a single test case in the following format.

$$h \ w$$ $$c_{1,1} c_{1,2} \cdots c_{1,2w+1}$$ $$c_{2,1} c_{2,2} \cdots c_{2,2w+1}$$ $$\vdots$$ $$c_{2h+1,1} c_{2h+1,2} \cdots c_{2h+1,2w+1}$$

$h$ and $w$ represent the size of the dungeon, each of which is an integer between $2$ and $500$, inclusive. The characters $c_{i,j}$ ($1 \leq i \leq 2h+1$, $1 \leq j \leq 2w+1$) represent the configuration of the dungeon as follows:

• $c_{2i,2j} = \text{'}.\text{'}$ for $1 \leq i \leq h$ and $1 \leq j \leq w$, which corresponds to the room $i$-th from the north end and $j$-th from the west end of the dungeon; such a room is called the room $(i,j)$.
• $c_{2i+1,2j} = \text{'}.\text{'}$ or $\text{'}-\text{'}$ for $1 \leq i \leq h-1$ and $1 \leq j \leq w$, which represents the wall between the rooms $(i,j)$ and $(i+1,j)$; the character $\text{'}.\text{'}$ means that the wall has a doorway and $\text{'}-\text{'}$ means it has no doorway.
• $c_{2i,2j+1} = \text{'}.\text{'}$ or $\text{'}|\text{'}$ for $1 \leq i \leq h$ and $1 \leq j \leq w-1$, which represents the wall between the rooms $(i,j)$ and $(i,j+1)$; the character $\text{'}.\text{'}$ means that the wall has a doorway and $\text{'}|\text{'}$ means it has no doorway.
• $c_{1,2j} = c_{2h+1,2j} = \text{'}-\text{'}$ ($1 \leq j \leq w$) and $c_{2i,1} = c_{2i,2w+1} = \text{'}|\text{'}$ ($1 \leq i \leq h$), which correspond to the outer walls of the dungeon.
• $c_{2i+1,2j+1} = \text{'}+\text{'}$ for $0 \leq i \leq h$ and $0 \leq j \leq w$, which corresponds to an intersection of walls or outer walls.

The entrance and the exit of the dungeon are in the rooms $(1,1)$ and $(h,w)$, respectively. The configuration satisfies the tree property stated above.

输出格式

Output the maximum length of the route from the entrance room to the exit room achievable by the remodeling, where the length of a route is the number of rooms passed including both the entrance and exit rooms.

2 3
+-+-+-+
|.....|
+.+.+.+
|.|.|.|
+-+-+-+

6

2 3
+-+-+-+
|...|.|
+.+.+.+
|.|...|
+-+-+-+

4

5 5
+-+-+-+-+-+
|...|...|.|
+-+.+.+.+.+
|...|.|.|.|
+.+.+.+-+.+
|.|...|.|.|
+.+.+-+.+.+
|.|.....|.|
+-+.+.+-+.+
|...|.....|
+-+-+-+-+-+

15

提示

In the first sample, if you block the doorway between the rooms $(1,1)$ and $(1,2)$ and construct a new doorway between the rooms $(2,1)$ and $(2,2)$, then the unique route from $(1,1)$ to $(2,3)$ passes all of the 6 rooms, which is obviously the maximum.

In the second sample, any remodeling keeps the length of the unique route from $(1,1)$ to $(2,3)$ to be exactly 4.

In the third sample, one of the optimal ways is blocking the doorway between the rooms $(4,2)$ and $(4,3)$ and constructing a new doorway between the rooms $(2,4)$ and $(3,4)$.

The configurations after the remodeling described above are as follows.

+-+-+-+ +-+-+-+ +-+-+-+-+-+
|.|...| |...|.| |...|...|.|
+.+.+.+ +.+.+.+ +-+.+.+.+.+
|...|.| |.|...| |...|.|.|.|
+-+-+-+ +-+-+-+ +.+.+.+.+.+
                |.|...|.|.|
                +.+.+-+.+.+
                |.|.|...|.|
                +-+.+.+-+.+
                |...|.....|
                +-+-+-+-+-+