#include<bits/stdc++.h>
using namespace std;
int l,n,m,minn=10000000;
char a[35][35][35];
int dz[6]={0,0,0,0,1,-1};
int dx[6]={0,0,1,-1,0,0};
int dy[6]={1,-1,0,0,0,0};
void dfs(int z,int x,int y,int tot){
	int sz,sx,sy;
	a[z][x][y]='#';
	for(int i=0;i<6;i++){
		sz=z+dz[i];
		sx=x+dx[i];
		sy=y+dy[i];
		if(sz>=1&&sz<=l&&sx>=1&&sx<=n&&sy>=1&&sy<=m){
		    if(a[sz][sx][sy]=='E'){
				minn=min(minn,tot+1);
				return;
			}
			if(a[sz][sx][sy]=='.'){
				dfs(sz,sx,sy,tot+1);
			}
		}
	}
}
int main(){
	cin>>l>>n>>m;
	int fz,fx,fy;
	for(int i=1;i<=l;i++){
		for(int j=1;j<=n;j++){
			for(int k=1;k<=m;k++){
				cin>>a[i][j][k];
				if(a[i][j][k]=='S'){
					fz=i;
					fx=j;
					fy=k;
				}
			}
		}
	}
	dfs(fz,fx,fy,0);
	if(minn==10000000)cout<<"Trapped!";
	else cout<<"Escaped in "<<minn<<" minute(s).";
	return 0;
}