- [2146](https://www.acmicpc.net/problem/2146) : 다리 만들기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2146.cpp)

- [1926](https://www.acmicpc.net/problem/1926) : 그림 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1926.cpp)

- [2178](https://www.acmicpc.net/problem/2178) : 미로탐색 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2178.cpp)

- [1012](https://www.acmicpc.net/problem/1012) : 유기농 배추 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1012.cpp)

- [1697](https://www.acmicpc.net/problem/1697) : 숨바꼭질 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1697.cpp)

- [7576](https://www.acmicpc.net/problem/7576) : 토마토 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/7576.cpp)

- [7569](https://www.acmicpc.net/problem/7569) : 토마토(3차원) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/7569.cpp)

- [9466](https://www.acmicpc.net/problem/9466) : 텀 프로젝트 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/9466.cpp)

- [2667](https://www.acmicpc.net/problem/2667) : 단지 번호 붙이기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2667.cpp)

- [2206](https://www.acmicpc.net/problem/2206) : 벽 부수고 이동하기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2206.cpp)

- [2583](https://www.acmicpc.net/problem/2583) : 영역 구하기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2583.cpp)

- [7562](https://www.acmicpc.net/problem/7562) : 나이트의 이동 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/7562.cpp)

- [10026](https://www.acmicpc.net/problem/10026) : 적록색약 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/10026.cpp)

- [2468](https://www.acmicpc.net/problem/2468) : 안전영역 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2468.cpp)

- [2573](https://www.acmicpc.net/problem/2573) : 빙산 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2573.cpp)

- [5427](https://www.acmicpc.net/problem/5427) : 불 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/5427.cpp)

- [5014](https://www.acmicpc.net/problem/5427) : 스타트링크 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/5014.cpp)

- [6593](https://www.acmicpc.net/problem/5427) : 상범빌딩 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/6593.cpp)

- [9963](https://www.acmicpc.net/problem/9963) : N-Queen = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/9963.cpp)

- [15649](https://www.acmicpc.net/problem/15649) : N과 M(1) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15649.cpp)

- [15650](https://www.acmicpc.net/problem/15650) : N과 M(2) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15650.cpp)

- [15651](https://www.acmicpc.net/problem/15651) : N과 M(3) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15651.cpp)

- [15652](https://www.acmicpc.net/problem/15652) : N과 M(4) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15652.cpp)

- [15654](https://www.acmicpc.net/problem/15654) : N과 M(5) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15654.cpp)

- [15655](https://www.acmicpc.net/problem/15655) : N과 M(6) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15655.cpp)

- [15656](https://www.acmicpc.net/problem/15656) : N과 M(7) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15656.cpp)

- [15657](https://www.acmicpc.net/problem/15657) : N과 M(8) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15657.cpp)

- [15663](https://www.acmicpc.net/problem/15663) : N과 M(9) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15663.cpp)

- [15664](https://www.acmicpc.net/problem/15664) : N과 M(10) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15664.cpp)

- [15665](https://www.acmicpc.net/problem/15665) : N과 M(11) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15665.cpp)

- [15666](https://www.acmicpc.net/problem/15666) : N과 M(12) = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/15666.cpp)

#include <iostream>

#include <tuple>

#include <queue>

#include <cstring>

using namespace std;

#define MAX 30

int dx[6] = {1,-1,0,0,0,0};

int dy[6] = {0,0,-1,1,0,0};

int dz[6] = {0,0,0,0,1,-1};

int l,r,c;

tuple<int,int,int> start;

tuple<int,int,int> escape;

int dis[MAX][MAX][MAX];

char arr[MAX][MAX][MAX];

void initMEM(){

memset(dis,-1,sizeof(dis));

memset(arr,' ', sizeof(arr));

}

void bfs(){

queue<tuple<int,int,int>> q;

q.push(start);

dis[get<0>(start)][get<1>(start)][get<2>(start)] = 0;

while(!q.empty())

{

auto cur = q.front();

q.pop();

int z = get<0>(cur);

int x = get<1>(cur);

int y = get<2>(cur);

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

{

int nz = z + dz[i];

int nx = x + dx[i];

int ny = y + dy[i];

if(nx < 0 || nx >= r || ny < 0 || ny >= c || nz < 0 || nz >= l) continue;

if(dis[nz][nx][ny] != -1) continue;

if(arr[nz][nx][ny] == '#') continue;

q.push(make_tuple(nz,nx,ny));

dis[nz][nx][ny] = dis[z][x][y] + 1;

}

}

}

int main(){

ios::sync_with_stdio(0);

cin.tie(0);

char t;

while(true){

cin >> l >> r >> c;

if(l == 0 && r == 0 && c == 0) break;

initMEM();

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

{

for(int j = 0; j<r; j++)

{

for(int k = 0; k<c; k++)

{

cin >> t;

arr[i][j][k] = t;

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

start = make_tuple(i,j,k);

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

escape = make_tuple(i,j,k);

}

}

}

bfs();

if(dis[get<0>(escape)][get<1>(escape)][get<2>(escape)] != -1){

cout << "Escaped in " << dis[get<0>(escape)][get<1>(escape)][get<2>(escape)] << " minute(s)." << '\n';

}

else cout << "Trapped!"<< '\n';

}

return 0;

}