Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem D

The Great Escape

PoorKianoosh! 6 weeks since he was officially accepted as a citizen of Barareh andduring this time he has had nothing but Nochophskew for his breakfast, lunchand dinner. And nowadays, during the nights, he dreams of nothing but a smallpiece of bread, some cheese and a glass of milk to have for his breakfast. Andduring the days, he thinks of nothing but a great escape from this weird cityin order to turn his night-time dreams into reality.

Aftercarefully checking all the potential ways out of the city, he concluded thatthere are only three such possible ways. The first one is through the city gatewhich is of course guarded by fully-armed guards, ready to kill any creaturetrying to go through the gate without permission. The second way is passingthrough the northern walls of the city and going through a jungle whichcontains nothing but those deadly snakes called NeshimanGazes (And be sure thatKianoosh does not like to repeat his creepy experience with them again).

Finally,the third and the last (and of course the only feasible) way is passing througha secret door in the famous so called HezarDaroon Castle(means a castle with thousands of doors). Unfortunately, the problem with thiscastle is that no one actually knows the way to reach this secret door.

Afterspending some time gathering information about the castle, Kianoosh found outthat HezarDaroon can actually be modeled as an  grid with each cellrepresenting a room in the castle. There is always a door between twoneighboring rooms but there are some rooms which contain a NeshimanGaz ready toserve anyone trying to enter the room with its poisonous bites.

Thereare also some rooms which contain a rotating door. A rotating door is actually acylinder positioned at the center of the room with a slice removed from it. InFigure 1, you can see a room with a rotating door with its removed slice facingtowards west.

Figure 1. A Rotating Door

Asit can be seen, one can only enter the room from the neighbor to which theremoved slice is facing. And once Kianoosh enters the room, he can rotate thedoor clockwise or counter-clockwise in order to reach the other doors in theroom. For example, in the configuration of figure 1, if he rotates the doorclockwise by 90 degrees, he can reach the door to the north and if he continuesrotating the door by another 90 degrees in the same direction, he can reach thedoor to east.

Anotherimportant fact about the rotating doors is that associated to each door is anumber  which is the amount oftime, measured in seconds, that it takes for a normal human-being(likeKianoosh) to rotate the door by 90 degrees. You may also assume that going froma room to its neighbor room takes exactly 1 second.

Today,after spending a noticeable amount of money, Kianoosh managed to buy a map ofthe castle from underground shops of Barareh. Taking a look at the map, hefound that the entrance to the castle is located at the lower-left corner andthe secret door is located at the upper-right corner of the grid. He can alsosee the position and the initial configuration of the rotating doors and thecoordinates of rooms containing the deadly NeshimanGazes to which Kianoosh doesnot like to enter.

Kianooshis happy. He is only one step away from his dreams coming true. But how can hefind his way to the secret door? Yes! He needs help! And as a geniusproblem-solver, you should help him find the path with the minimum requiredtime to reach the secret passage from the lower-left corner of the castle.

The Input

Thefirst line of the input contains an integer  which is the number oftest cases. Each test case begins with a line containing (the number of rows) and (the number of columns) followed by  lines, with the th line containing  characters, the th character of which representing the status of the th cell in the th row of the grid (counted from north). Each character mayhave six different values. A ‘.’ character represents anormal room while a ‘#’ represents a room containing a NeshimanGaz and ‘N’, ‘W’, ‘E’, ‘S’ represent a room with arotating door facing north, west, east, and south respectively. The map isfollowed by  integers, the th of which is equal to  for the th door, counting the doors from the north-west corner in arow major order. You can assume that (which is the number of rotating doors in the castle) is nomore than 500, and the entrance (room at lower-left corner) and the roomcontaining the secret door (room at upper-right corner) does not containNeshimanGazes or rotating doors.

The Output

Foreach test case, your program should output a line containing a single integerwhich is the minimum amount of time required for Kianoosh to reach the secretdoor. In the case the secret door is not reachable with respect to the givenmap and rules, a line containing the phrase “Poor Kianoosh” should be printed.

Sample Input

1

3 3
.#.
..W
...
10

Sample Output

14