Angel was caught bythe MOLIGPY! He was putin prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs inthe prison.
Angel's friends want to save Angel. Their task is: approach Angel. We assume that"approach Angel"istogettothe position where Angel stays. When there's a guard inthe grid, we must kill him (or her?) to move intothe grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.
You have to calculate the minimal timeto approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, tothe neighbor grid within bound, of course.)
1 2 3 4 5
First line contains two integers stand for N and M.
Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and"r" stands for each of Angel's friend.
Processto the endof the file.
For each test case, your program should output a single integer, standing forthe minimal time needed. If such anumber does no exist, you should output aline containing "Poor ANGEL has to stay in the prison all his life."