You are in a 3D labyrinth of Conflict Empire and you want to escape it. The labyrinth could be represented as a three dimensional array where every cell is either empty or filled by rock. In every minute, you can travel in any direction parallel to the edges of the labyrinth, i. e. north, south, east, west, up and down, by one cell. You are not allowed to step onto a rock cell nor allowed to travel out of the labyrinth without reaching the exit point. Given the starting point and the exit point, your task is to determine the minimum time needed to escape this labyrinth. Input
The first line of the input contains three integers K, N and M (1 <= K, N,M <= 30), indicating the number of layers, rows and columns of the labyrinth, respectively. Then there follows K blocks of N lines each containing M characters. Each character describes one cell of the labyrinth, where # indicates a cell of rock and indicates an empty cell. The starting position is indicated by S and the exit by E. S and E never overlap, they are always at distinct locations. There is always exactly one starting position and one exit position. There will be a single blank line after each level.
Output х is the minimum time needed to escape this labyrinth, or Print one line Escaped in x minute(s). where Trapped! if it is impossible to escape. Example 1 Input: 3 4 5 S .###. .##..##.## ##... #.### E Output: Escaped in 11 minute(s). Example 2 Input: 1 3 3 S## #E# ### Output: Trapped!