Crank#2731
Chev Chelios had his heart stolen by the boss of the most dangerous gang in the city. His heart was replaced with an artificial, rechargeable one!
Chelios has been trying to find the boss to get his heart back, but without success. Now the battery of his artificial heart is about to expire! Fortunately, he has finally found the target, but he needs your help to get there before his artificial heart stops beating!
Chelios decided to attack the boss's building from the roof, as all the entrances are heavily guarded by gangsters. He has a map of the gang's block, showing the heights of all the buildings in the block. The plan is for a helicopter to drop Chelios on the roof of one of the buildings on the boundary of the block at night. Then, Chelios will move to adjacent buildings, vertically or horizontally, to reach the boss's building. Chelios can only move to a building that has the same or less height than the current building (climbing up severely affects his damaged heart).
Given the map of the gang's building block with the heights of all buildings and the location of the boss's building, write a program to determine the number of boundary buildings where Chev Chelios can be dropped by helicopter so that he can reach the boss's building without climbing up!
The first line contains an integer , the number of test cases. test cases follow. The first line of each test case contains two integers and (1 \le R, C \le 10), the height and width of the building block. The second line contains two integers and (1 \le A \le R, 1 \le B \le C), the coordinates of the boss's building on the map. Then follow lines; each consists of space-separated integers representing the heights of all buildings. The height of a building satisfies (1 \le H \le 1000).
For each test case, print the number of boundary buildings where Chev Chelios can be dropped by helicopter so that he can reach the boss's building without climbing up! Follow the output format below.
Example 1