int dx[] = { ,,,,,- };

int dy[] = { ,,-,,, };

int dz[] = { ,-,,,, };

#include <cstdio>

#include <iostream>

#include <queue>

#include <algorithm>

#include <cstring>

using namespace std;

int r, n, m;

string s[][];

struct node

{

    int x, y, z;

    int t;

};

node Begin, End;

queue <node> que;

int dx[] = { ,,,,,- };

int dy[] = { ,,-,,, };

int dz[] = { ,-,,,, };

int vis[][][];

int bfs()

{

    que.push(Begin);

    vis[Begin.x][Begin.y][Begin.z] = ;

    while (!que.empty())

    {

        node front = que.front();

        que.pop();

        if (front.x == End.x && front.y == End.y && front.z == End.z) return front.t;

        for (int i = ; i < ; i++)

        {

            node tmp;

            tmp.x = front.x + dx[i];

            tmp.y = front.y + dy[i];

            tmp.z = front.z + dz[i];

            tmp.t = front.t + ;

            if (tmp.x >=  && tmp.x < r && tmp.y >=  && tmp.y < n && tmp.z >=  && tmp.z < m && !vis[tmp.x][tmp.y][tmp.z] && s[tmp.x][tmp.y][tmp.z] != '#')

            {

                que.push(tmp);

                vis[tmp.x][tmp.y][tmp.z] = ;

            }

        }

    }

    return -;

}

int main()

{

    while (cin >> r >> n >> m)

    {

        if (r ==  && n ==  && m == ) break;

        memset(vis, , sizeof(vis));

        while (!que.empty())

        {

            que.pop();

        }

        for (int i = ; i < r; i++) {

            string ret;

            for (int j = ; j < n; j++) {

                cin >> s[i][j];

                for (int k = ; k < m; k++) {

                    if (s[i][j][k] == 'S') {

                        Begin.x = i, Begin.y = j, Begin.z = k; Begin.t = ;

                    }

                    else if (s[i][j][k] == 'E') {

                        End.x = i, End.y = j, End.z = k; End.t = ;

                    }

                }

            }

        }

        int ans = bfs();

        if (ans == -) {

            printf("Trapped!\n");

        }

        else {

            printf("Escaped in %d minute(s).\n", ans);

        }

    }

    return ;

}