#include<iostream>

#include<cstring>

#include<cstdio>

#include<algorithm>

#include<queue>

using namespace std;

int counts[][][];//记录到起点的最短距离

struct Node{

   int x;

   int y;

   int z;

   int step;

};

int n,m,l;//长，宽，高

char map1[][][];//原来的三维的地图

int startx,starty,startz;//起点坐标

int endx,endy,endz;//终点坐标

int BFS(int x,int y,int z){

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

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

     int zzz[]={-,,,,,};//六个方向的对应的3个坐标

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

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

          for(int k=;k<=m;k++)//初始化

             counts[i][j][k]=;

     counts[x][y][z]=;//注意这里的初始化

     queue<Node>Q;

     Node tt;

     tt.x=x;tt.y=y;tt.z=z;tt.step=;

     Q.push(tt);

    while(!Q.empty()){

        Node temp=Q.front();

        Q.pop();

        int xx=temp.x;

        int yy=temp.y;

        int zz=temp.z;

        int step=temp.step;

        for(int i=;i<;i++){//六个方向进行搜索

            if(xx+xxx[i]>=&&xx+xxx[i]<=n&&yy+yyy[i]>=&&yy+yyy[i]<=m&&zz+zzz[i]>=&&zz+zzz[i]<=l){

                if(map1[zz+zzz[i]][xx+xxx[i]][yy+yyy[i]]!='#'&&step+<counts[zz+zzz[i]][xx+xxx[i]][yy+yyy[i]]){

                    counts[zz+zzz[i]][xx+xxx[i]][yy+yyy[i]]=step+;

                    Node ttt;

                    ttt.x=xx+xxx[i];

                    ttt.y=yy+yyy[i];

                    ttt.z=zz+zzz[i];

                    ttt.step=step+;

                    Q.push(ttt);

                }

            }

        }

    }

  return counts[endz][endx][endy];//返回终点距离

}

int main(){

   while(~scanf("%d%d%d",&l,&n,&m)&&l&&n&&m){

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

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

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

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

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

                    startz=i;

                    startx=j;

                    starty=k;

                }

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

                    endz=i;

                    endx=j;

                    endy=k;

                }

            }

        }

       }

       int ans=BFS(startx,starty,startz);

       if(ans==)

        printf("Trapped!\n");

       else

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

   }

}