#include<bits/stdc++.h>
using namespace std;
int l,r,c,ax,ay,az,bx,by,bz,minn=INT_MAX,vis[35][35][35];
int go[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
char mapp[35][35][35];
void dfs(int x,int y,int z,int ans){
	if(x==bx&&y==by&&z==bz){
		minn=min(minn,ans);
	}
	vis[ax][ay][az]=1;
	for(int i=0;i<6;i++){
		int xx=x+go[i][0];
		int yy=y+go[i][1];
		int zz=z+go[i][2];
		if(xx>=1&&xx<=r&&yy>=1&&yy<=c&&zz>=1&&zz<=l&&!vis[xx][yy][zz]&&mapp[zz][xx][yy]!='#'){
			vis[xx][yy][zz]=1;
			dfs(xx,yy,zz,ans+1);
		}
	}
}
int main(){
	cin>>l>>r>>c;
	for(int i=1;i<=l;i++){
		for(int j=1;j<=r;j++){
			for(int k=1;k<=c;k++){
				cin>>mapp[i][j][k];
				if(mapp[i][j][k]=='S'){
					az=i;
					ax=j;
					ay=k;
				}else if(mapp[i][j][k]=='E'){
					bz=i;
					bx=j;
					by=k;
				}
			}
		}
	}
	dfs(ax,ay,az,0);
	if(minn==INT_MAX){
		cout<<"Trapped!";
		return 0;
	}
	cout<<"Escaped in "<<minn<<" minute(s).";
	return 0;
}