#include <iostream>
#include <queue>
#include <cstdio>
using namespace std;
const int N = 110;
char a[N][N][N];
int z, x, y;
struct node{
    int z, x, y;
    int step;
};
node st, ed;
int dic[6][3] = {
    {1, 0, 0}, {0, 0, 1}, {-1, 0, 0},
    {0, 0, -1}, {0, -1, 0}, {0, 1, 0}
};
void read(){
    for(int i = 0; i < z; i ++ ){
        for(int j = 0; j < x; j ++ ){
            for(int k = 0; k < y; k ++ ){
                cin >> a[i][j][k];
                if(a[i][j][k] == 'E')   ed = {i, j, k};
                else if(a[i][j][k] == 'S')  st = {i, j, k};
            }    
        }
    }
}
int bfs(){
    queue<node> qu;
    st.step = 0;
    qu.push(st);
    a[st.z][st.x][st.y] = '#';
    while(!qu.empty()){
        node now = qu.front();
        qu.pop();
        for(int i = 0; i < 6; i ++ ){
            int zz = now.z + dic[i][0];
            int xx = now.x + dic[i][1];
            int yy = now.y + dic[i][2];
            if(zz == ed.z && xx == ed.x && yy == ed.y)  return now.step+1;
            if(zz >= 0 && zz < z && xx >= 0 && xx < x && yy >= 0 && yy < y && a[zz][xx][yy] != '#'){
                a[zz][xx][yy] = '#';
                qu.push({zz, xx, yy, now.step+1});
            }
        }
    }
    return -1;
}
/*  调试所用
void print(){
    for(int i = 0; i < z; i ++ ){
        for(int j = 0; j < x; j ++ ){
            for(int k = 0; k < y; k ++ ){
                cout << a[i][j][k];
            }
        }
        cout << endl;
    }
}
*/
int main(){
    while(cin >> z >> x >> y && (z && x && y)){
        read();
        // print();

        int res = bfs();
        if(res == -1)   cout << "Trapped!" << endl;
        else    printf("Escaped in %d minute(s).\n", res);
    }
    return 0;
}