#include <iostream>
#include <queue>
#include <algorithm>
#define MAX_NUM 32
using namespace std;
int dx[6] = { 1,0,-1,0,0,0 };
int dy[6] = { 0,1,0,-1,0,0 };
int dh[6] = { 0,0,0,0,1,-1 };
char arr[MAX_NUM][MAX_NUM][MAX_NUM];
int visited[MAX_NUM][MAX_NUM][MAX_NUM];
struct data { int h, x, y; } data;
queue<struct data> q;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int l, r, c;
while (true) {
cin >> l >> r >> c;
if (l == 0 && r == 0 && c == 0)
break;
for (int k = 0; k < l; k++) {
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> arr[k][i][j];
if (arr[k][i][j] == 'S')
q.push({ k,i,j });
}
}
}
int answer = 0;
while (!q.empty()) {
int h = q.front().h;
int x = q.front().x;
int y = q.front().y;
q.pop();
if (arr[h][x][y] == 'E') {
answer = visited[h][x][y];
break;
}
for (int k = 0; k < 6; k++) {
int nh = h + dh[k];
int nx = x + dx[k];
int ny = y + dy[k];
if (nh < 0 || nh >= l || nx < 0 || nx >= r || ny < 0 || ny >= c) continue;
if (arr[nh][nx][ny] == '#' || arr[nh][nx][ny] == 'S' || visited[nh][nx][ny] != 0) continue;
q.push({ nh,nx,ny });
visited[nh][nx][ny] = visited[h][x][y] + 1;
}
}
(answer == 0) ? cout << "Trapped!\n" : cout << "Escaped in " << answer << " minute(s).\n";
for (int k = 0; k < l; k++) {
for (int i = 0; i < r; i++) {
fill(visited[k][i], visited[k][i] + c, 0);
}
}
while (!q.empty())
q.pop();
}
return 0;
}