描述：
1 2 3 4 5 6 7
#############################
1 # | # | # | | #
#####---#####---#---#####---#
2 # # | # # # # #
#---#####---#####---#####---#
3 # | | # # # # #
#---#########---#####---#---#
4 # # | | | | # #
#############################
(Figure 1)
# = Wall
| = No wall
- = No wall
Figure 1 shows the map of a castle.Write a program that calculates
1. how many rooms the castle has
2. how big the largest room is
The castle is divided into m * n (m<=50, n<=50) square modules. Each such module can have between zero and four walls.
输入：
Your program is to read from standard input. The first line contains the number of modules in the north-south direction and the number of modules in the east-west direction. In the following lines each module is described by a number (0 <= p <= 15). This number is the sum of: 1 (= wall to the west), 2 (= wall to the north), 4 (= wall to the east), 8 (= wall to the south). Inner walls are defined twice; a wall to the south in module 1,1 is also indicated as a wall to the north in module 2,1. The castle always has at least two rooms.
输出：
Your program is to write to standard output: First the number of rooms, then the area of the largest room (counted in modules).
样例输入：
4
7
11 6 11 6 3 10 6
7 9 6 13 5 15 5
1 10 12 7 13 7 5
13 11 10 8 10 12 13
样例输出：
5
9
翻译：
描述：
1 2 3 4 5 6 7
#############################
1 # | # | # | | #
#####---#####---#---#####---#
2 # # | # # # # #
#---#####---#####---#####---#
3 # | | # # # # #
#---#########---#####---#---#
4 # # | | | | # #
#############################
(Figure 1)
# = Wall
| = No wall
- = No wall
数字1显示了一个城堡的地图。请写一个程序来计算
1.这个城堡中有多少个房间
2.最大的房间有多大
这个城堡被分成了m*n（m<=50,n<=50）的模块平方。每个这样的模块都有0到4面墙。
输入：
你的程序就是去从标准输入中读取。第一行包含在南北方向的模块的数目和东西方向的模块的数目。下面几行每个模块用一个数字p来描述。这个数字是1,（=西面墙）2（北面墙）4（东面墙）8（南面墙）的总和。内层墙被再次定义；在南面墙的模块1，1也北面墙的模块2,，1这个城堡至少有两个房间。
输出：
你的程序就是写出标准输出：第一个数房间的数目，然后是最大房间的面积（用模块来表示）
样例输入：
4
7
11 6 11 6 3 10 6
7 9 6 13 5 15 5
1 10 12 7 13 7 5
13 11 10 8 10 12 13
样例输出：
5
9