B

//纯bfs
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>

using namespace std;
const int maxn = 33;
char g[maxn][maxn][maxn];
bool vis[maxn][maxn][maxn];
int f[6][3] = { { 1, 0, 0 }, { -1, 0, 0 }, { 0, 1, 0 }, { 0, -1, 0 }, { 0, 0, 1 }, { 0, 0, -1 } };
int L, R, C;
struct node{
    int x, y, z;
    int flag;
}last, now;

void bfs(int x1, int y1, int z1){
    vis[z1][x1][y1] = true;
    queue<node>q;
    while (!q.empty()){
        q.pop();
    }
    last.x = x1; last.y = y1; last.z = z1;
    last.flag = 0;
    q.push(last);
    while (!q.empty()){
        last = q.front();
        q.pop();
        if (g[last.z][last.x][last.y] == 'E'){
            cout << "Escaped in " << last.flag << " minute(s)." << endl;
            return;
        }
        for (int i = 0; i < 6; i++){
            now.z = last.z + f[i][0];
            now.x = last.x + f[i][1];
            now.y = last.y + f[i][2];
            now.flag = last.flag + 1;
            if (now.z < 0 || now.z >= L || now.x < 0 || now.y < 0 || now.x >= R || now.y >= C)
                continue;
            if (!vis[now.z][now.x][now.y] && g[now.z][now.x][now.y] != '#'){
                vis[now.z][now.x][now.y] = true;
                q.push(now);
            }
        }
    }
    cout << "Trapped!" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    while (cin>>L>>R>>C){
        if (!L && !R && !C)
            break;
        int x, y, z;
        memset(vis, false, sizeof(vis));
        for (int i = 0; i < L; i++){
            for (int j = 0; j < R; j++){
                for (int k = 0; k < C; k++){
                    char s;
                    cin >> s;
                    g[i][j][k] = s;
                    if (s == 'S'){
                        z = i; x = j; y = k;
                    }
                }
            }
        }
        bfs(x, y, z);
        
    }
    return 0;
}