#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

using namespace std;

bool map1[][][];

bool vis[][][];

int L,R,C;

int Sl,Sr,Sc,El,Er,Ec;

struct state

{

    int l,r,c;

    int num;

    state() {}

    state(int x,int y,int z,int n):l(x),r(y),c(z),num(n) {}

};

bool judge(int x,int y,int z)

{

    if(x<=||x>L||y<=||y>R||z<=||z>C)

        return ;

    if(map1[x][y][z]==)

        return ;

    if(vis[x][y][z])

        return ;

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

    return ;

}

int bfs()

{

    queue <state> que;

    state temp;

    int tl,tr,tc;

    que.push(state(Sl,Sr,Sc,));

    while(!que.empty())

    {

        temp=que.front();

        que.pop();

        if(temp.l==El&&temp.r==Er&&temp.c==Ec)

            return temp.num;

        tl=temp.l;

        tr=temp.r;

        tc=temp.c;

        if(judge(tl-,tr,tc))

            que.push(state(tl-,tr,tc,temp.num+));

        if(judge(tl+,tr,tc))

            que.push(state(tl+,tr,tc,temp.num+));

        if(judge(tl,tr-,tc))

            que.push(state(tl,tr-,tc,temp.num+));

        if(judge(tl,tr+,tc))

            que.push(state(tl,tr+,tc,temp.num+));

        if(judge(tl,tr,tc-))

            que.push(state(tl,tr,tc-,temp.num+));

        if(judge(tl,tr,tc+))

            que.push(state(tl,tr,tc+,temp.num+));

    }

    return -;

}

int main()

{

    char s[];

    int ans;

    ios::sync_with_stdio(false);

    while(cin>>L>>R>>C)

    {

        memset(vis,,sizeof(vis));

        if(!L&&!R&&!C)

            break;

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

            for(int j=;j<=R;++j)

            {

                cin>>s;

                for(int k=;k<=C;++k)

                    switch(s[k-])

                    {

                        case 'S':

                            Sl=i;

                            Sr=j;

                            Sc=k;

                            map1[i][j][k]=;

                            break;

                        case 'E':

                            El=i;

                            Er=j;

                            Ec=k;

                            map1[i][j][k]=;

                            break;

                        case '.':

                            map1[i][j][k]=;

                            break;

                        case '#':

                            map1[i][j][k]=;

                            break;

                    }

            }

        ans=bfs();

        if(ans!=-)

            cout<<"Escaped in "<<ans<<" minute(s).\n";

        else

            cout<<"Trapped!\n";

    }

    return ;

}