Java Mijid the Great is the king of Dodars territory. He likes to travel between the cities in his territory and actually, you can never see him in the same city as where he was the day before. Therefore, he captured all territories of his continent! In spite of this fact, he has seen all cities of his territory so far and wants to capture another continent in order to have some choices to travel into new cities. Now, having the world map, he needs your help to find the biggest continent except the one in which he resides. Maps are given as M × N tables, filled with at most two different letters denoting land and water regions. A continent is a set of connected land regions which is completely surrounded by water regions or the end of map. Two regions are assumed to be connected if they have an edge in common. The coordinates of top left region is (0,0) and bottom right region (M − 1, N − 1). Region with coordinates (x, N − 1) should be assumed to have a common edge with region (x, 0) for every x between 0 and M − 1 (inclusive). Input There will be several test cases. Each test case contains two integers M ≤ 20 and N ≤ 20 in the first line denoting the number of rows and columns in the map respectively. Next, there will be M lines of exactly N characters representing the map. Finally in the last line there would be two integers 0 ≤ X < M and 0 ≤ Y < N , the coordinates of the region in which Mijid the Great currently stays. There will one blank line after each test case.

Output
For each test case, output a line containing an integer that is the number of regions in the biggest continent that Mijid the Great can capture.