POJ 2251 JAVA

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main
{
	public static void main(String args[])
	{
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext())
		{

			int dir[][] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};
			int a ,b,c;
			a=sc.nextInt();b=sc.nextInt();c=sc.nextInt();
			if (a==0 && b==0 && c==0)
			{
				break;
			}else {
				
			char arr[][][]=new char[a][b][c];
			boolean map[][][]=new boolean[a][b][c];

			int x=0;int y = 0;int z=0;
			for (int i = 0; i < a; i++)
			{
				for (int j = 0; j < b; j++)
				{
					arr[i][j]=sc.next().toCharArray();
					for (int k = 0; k < arr[i][j].length; k++)
					{
						if (arr[i][j][k]=='S')
						{
							x=i;y=j;z=k;
						}
					}
				}
			}
			Queue<ok>find=new LinkedList();
			ok e=new ok(x,y,z,0);
			map[x][y][z]=true;
			find.offer(e);
			boolean last=false;

			while(!find.isEmpty()) {
				ok yes=find.poll();

				if (arr[yes.a][yes.b][yes.c]=='E')
				{
				last=true;	System.out.println("Escaped in "+yes.d+" minute(s).");break;
				}
				for (int i = 0; i < dir.length; i++)
				{
					int xx=yes.a+dir[i][0];int yy=yes.b+dir[i][1];int zz=yes.c+dir[i][2];
					if (xx>=0 && xx<a && yy>=0 && yy<b && zz>=0 && zz<c && arr[xx][yy][zz]!='#' && map[xx][yy][zz]==false)
					{
						
						ok lol=new ok(xx, yy, zz, yes.d+1);
					
						map[xx][yy][zz]=true;
						find.add(lol);
					}
				}
			}
			if (last==false)
			{
				System.out.println("Trapped!");
			}
			
			
			
		}
	}
	}
}
class ok{
	public int a,b,c,d;
	public  ok(int x,int y ,int z,int zz) {
		a=x;b=y;c=z;d=zz;
	}
}