Problem H: Dungeon Master 
-------------------------
You are trapped in a 3D dungeon and need to find the quickest way out! 
The dungeon is composed of unit cubes which may or may not be filled 
with rock.  It takes one minute to move one unit north, south, east, 
west, up or down.  You cannot move diagonally and the maze is surrounded 
by solid rock on all sides.  Is an escape possible?  If yes, how long 
will it take?

Input
-----
The input file consists of N dungeons (1 <= N <= 25).  Each dungeon 
description starts with a line containing three integers L, R and 
C (1 <= L <= 30 and 2 <= R, C <= 30).  L is the number of levels making 
up the dungeon.  R and C are the number of rows and columns making up 
the plan of each level.

Then there will follow L blocks of R lines each containing C characters. 
Each character describes one cell of the dungeon.  A cell full of rock is 
indicated by a `#' and empty cells are represented by a `.'.  Your starting 
position is indicated by `S' and the exit by the letter 'E'.  There is a 
single blank line after each level.  Input is terminated by three zeroes 
for L, R and C.

Output
------
Each dungeon generates one line of output.  If it is possible to reach the 
exit, print a line of the form

Escaped in x minute(s).

where x is replaced by the shortest time it takes to escape.  If it is not 
possible to escape, print the line

Trapped!

Sample Input 
------------
3 4 5
S....
.###.
.##..
###.#

#####
#####
##.##
##...

#####
#####
#.###
####E

1 3 3
S##
#E#
###

0 0 0

Sample Output 
-------------
Escaped in 11 minute(s).
Trapped!