On a small planet named Bandai, a landing party of the starship Tadamigawa discovered colorful cubes traveling on flat areas of the planet surface, which the landing party named beds. A cube appears at a certain position on a bed, travels on the bed for a while, and then disappears. After a longtime observation, a science officer Lt. Alyssa Ogawa of Tadamigawa found the rule how a cube travels on a bed.

A bed is a rectangular area tiled with squares of the same size.

- One of the squares is colored red,
- one colored green,
- one colored blue,
- one colored cyan,
- one colored magenta,
- one colored yellow,
- one or more colored white, and
- all others, if any, colored black.

Initially, a cube appears on one of the white squares. The cube’s faces are colored as follows.

top red bottom cyan north green south magenta east blue west yellow

The cube can roll around a side of the current square at a step and thus rolls on to an adjacent square. When the cube rolls on to a chromatically colored (red, green, blue, cyan, magenta or yellow) square, the top face of the cube after the roll should be colored the same. When the cube rolls on to a white square, there is no such restriction. The cube should never roll on to a black square.

Throughout the travel, the cube can visit each of the chromatically colored squares only once, and any of the white squares arbitrarily many times. As already mentioned, the cube can never visit any of the black squares. On visit to the final chromatically colored square, the cube disappears. Somehow the order of visits to the chromatically colored squares is known to us before the travel starts.

Your mission is to find the least number of steps for the cube to visit all the chromatically colored squares in the given order.

The input is a sequence of datasets. A dataset is formatted as follows:

w d

c_{11}. . .c_{w1}. . . . . .c_{1d}. . .c_{wd}v_{1}v_{2}v_{3}v_{4}v_{5}v_{6}

The first line is a pair of positive integers w and d separated by a space. The next d lines are
w-character-long strings *c*_{11} . . . *c*_{w1} , . . . , *c*_{1d} . . . *c _{wd}* with no spaces. Each character cij is one of
the letters r, g, b, c, m, y, w and k, which stands for red, green, blue, cyan, magenta, yellow,
white and black respectively, or a sign #. Each of r, g, b, c, m, y and # occurs once and only once
in a dataset. The last line is a six-character-long string

The integers *w* and *d* denote the width (the length from the east end to the west end) and the
depth (the length from the north end to the south end) of a bed. The unit is the length of a
side of a square. You can assume that neither *w* nor d is greater than 30.

Each character *c _{ij}* shows the color of a square in the bed. The characters

The string *v*_{1}*v*_{2}*v*_{3}*v*_{4}*v*_{5}*v*_{6} shows the order of colors of squares to visit. The cube should visit the
squares colored *v*_{1}, *v*_{2} , *v*_{3} , *v*_{4} , *v*_{5} and *v*_{6} in this order.

The end of the input is indicated by a line containing two zeros separated by a space.

For each input dataset, output the least number of steps if there is a solution, or "unreachable" if there is no solution. In either case, print it in one line for each input dataset.

10 5 kkkkkwwwww w#wwwrwwww wwwwbgwwww kwwmcwwwkk kkwywwwkkk rgbcmy 10 5 kkkkkkkkkk k#kkkkkkkk kwkkkkkwwk kcmyrgbwwk kwwwwwwwwk cmyrgb 10 5 kkkkkkkkkk k#kkkkkkkk kwkkkkkwkk kcmyrgbwwk kwwwwwwwwk cmyrgb 0 0

9 49 unreachable