Crank

No attempts yetTime limit1sMemory limit128 MB

Problem

Chev Chelios had his heart stolen by the boss of the most dangerous gang in the city. In its place he got a rechargeable artificial heart.

Since then Chelios has been looking for the boss to take his heart back, with no luck. The battery of the artificial heart is now almost out. He has finally found where the target is, but he needs your help to get there before the heart stops beating.

Every gate is heavily guarded, so Chelios decided to attack the boss's building from the roof. He has a map of the gang block that gives the height of every building in it. At night a helicopter drops Chelios onto the roof of one of the buildings on the boundary of the block. From there he moves between buildings that are adjacent horizontally or vertically. He can only move to a building whose height is equal to or smaller than the height of the building he is standing on, because climbing up puts too much strain on his damaged heart.

The boundary of the block is the first row, the last row, the first column, and the last column.

You are given the heights of every building in the block and the position of the boss's building. Write a program that counts the boundary buildings where the helicopter can drop Chelios so that he reaches the boss's building without ever climbing up.

Input

The first line contains an integer TT, the number of test cases.

The first line of each test case contains two integers RR and CC (1R,C101 \le R, C \le 10), the height and the width of the building block. The second line contains two integers AA (1AR1 \le A \le R) and BB (1BC1 \le B \le C), the coordinates of the boss's building. Then RR lines follow. The jj-th integer on the ii-th of those lines is the height HH (1H10001 \le H \le 1000) of the building in row ii and column jj, and the integers on one line are separated by spaces.

Output

For each test case, print one line in the form Case #x: y, where xx is the test case number starting from 1 and yy is the number of boundary buildings where the helicopter can drop Chelios so that he reaches the boss's building without ever climbing up.