Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Serial Time!

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe Cereal Guy's friend Serial Guy likes to watch soap operas. An episode is about to start, and he hasn't washed his plate yet. But he decided to at least put in under the tap to be filled with water. The plate can be represented by a parallelepiped *k* × *n* × *m*, that is, it has *k* layers (the first layer is the upper one), each of which is a rectangle *n* × *m* with empty squares ('.') and obstacles ('#'). The water can only be present in the empty squares. The tap is positioned above the square (*x*, *y*) of the first layer, it is guaranteed that this square is empty. Every minute a cubical unit of water falls into the plate. Find out in how many minutes the Serial Guy should unglue himself from the soap opera and turn the water off for it not to overfill the plate. That is, you should find the moment of time when the plate is absolutely full and is going to be overfilled in the next moment.

Note: the water fills all the area within reach (see sample 4). Water flows in each of the 6 directions, through faces of 1 × 1 × 1 cubes.

Input

The first line contains three numbers *k*, *n*, *m* (1 ≤ *k*, *n*, *m* ≤ 10) which are the sizes of the plate. Then follow *k* rectangles consisting of *n* lines each containing *m* characters '.' or '#', which represents the "layers" of the plate in the order from the top to the bottom. The rectangles are separated by empty lines (see the samples). The last line contains *x* and *y* (1 ≤ *x* ≤ *n*, 1 ≤ *y* ≤ *m*) which are the tap's coordinates. *x* is the number of the line and *y* is the number of the column. Lines of each layer are numbered from left to right by the integers from 1 to *n*, columns of each layer are numbered from top to bottom by the integers from 1 to *m*.

Output

The answer should contain a single number, showing in how many minutes the plate will be filled.

Examples

Input

1 1 1

.

1 1

Output

1

Input

2 1 1

.

#

1 1

Output

1

Input

2 2 2

.#

##

..

..

1 1

Output

5

Input

3 2 2

#.

##

#.

.#

..

..

1 2

Output

7

Input

3 3 3

.#.

###

##.

.##

###

##.

...

...

...

1 1

Output

13

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/26/2017 22:11:31 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|