//Memory   Time

//  356K     32MS

#include<iostream>

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<cmath>

#include<queue>

#include<algorithm>

using namespace std;

struct Node

{

    int x,y,z;

    int step;

};

queue<Node> que;

char Map[][][];

int sx,sy,sz;

int ex,ey,ez;

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

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

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

void read(int n,int row,int col)

{

    int i,j,k;

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

    {

        for(j=;j<row;j++)

        {

            for(k=;k<col;k++)

            {

                cin>>Map[i][j][k];

                if(Map[i][j][k]=='S')

                {

                    sx=i;

                    sy=j;

                    sz=k;

                }

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

                {

                    ex=i;

                    ey=j;

                    ez=k;

                }

            }

            getchar();

        }

        getchar();

    }

}

void BFS()

{

    Node q;

    q.x=sx;

    q.y=sy;

    q.z=sz;

    q.step=;

    que.push(q);

    while(!que.empty())

    {

        Node tp=que.front();

        que.pop();

        int x=tp.x;

        int y=tp.y;

        int z=tp.z;

        int step=tp.step;

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

        {

            int tx=x+dir_x[i];

            int ty=y+dir_y[i];

            int tz=z+dir_z[i];

            if(Map[tx][ty][tz]=='.')

            {

                Node Q;

                Q.x=tx;

                Q.y=ty;

                Q.z=tz;

                Q.step=step+;

                que.push(Q);

                Map[tx][ty][tz]='#';

            }

            else if(tx==ex&&ty==ey&&tz==ez)

            {

                cout<<"Escaped in "<<step+<<" minute(s)."<<endl;

                return;

            }

        }

    }

    cout<<"Trapped!"<<endl;

}

int main()

{

//    freopen("cin.txt", "r", stdin);

    int i, j, k;

    int n,row,col;

    while(cin>>n>>row>>col&&(n+row+col))

    {

        while(!que.empty()) que.pop();

        getchar();

        read(n,row,col);

        BFS();

    }

    return ;

}