Problem: 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.



Input

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


w d

c11 . . . cw1
.        .
.        .
.        .
c1d . . . cwd
v1v2v3v4v5v6


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 c11 . . . cw1 , . . . , c1d . . . cwd 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 v1v2v3v4v5v6 which is a permutation of “rgbcmy”.

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 cij shows the color of a square in the bed. The characters c11 , cw1 , c1d and cwd correspond to the north-west corner, the north-east corner, the south-west corner and the south- east corner of the bed respectively. If cij is a letter, it indicates the color of the corresponding square. If cij is a #, the corresponding square is colored white and is the initial position of the cube.

The string v1v2v3v4v5v6 shows the order of colors of squares to visit. The cube should visit the squares colored v1, v2 , v3 , v4 , v5 and v6 in this order.

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

Output

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.

Example

Input

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


Output

9
49
unreachable

Solution (in CPP):

Solution:
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <map>
using namespace std;

const int MAX_H = 30;
const int MAX_W = 30;

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

int W, H;
int G[MAX_H][MAX_W];
int order[6];
map<char, int> id;

struct S {
  int x, y, step, face[3], cost;
};
bool vis[MAX_H][MAX_W][7][7][7][7];

int bfs(int sx, int sy) {
  S s;
  queue<S> que;
  fill(vis[0][0][0][0][0], vis[MAX_H][0][0][0][0], false);
  s.x = sx;
  s.y = sy;
  s.step = 0;
  s.face[0] = 1;
  s.face[1] = 2;
  s.face[2] = 3;
  s.cost = 0;
  que.push(s);
  while(!que.empty()) {
    s = que.front(); que.pop();
    if(G[s.y][s.x] != 0) {
      if(G[s.y][s.x] == order[s.step]) {
	++s.step;
	if(s.step == 6) return s.cost;
      } else {
	continue;
      }
    }

    for(int i = 0; i < 4; ++i) {
      S t = s;
      t.x += dx[i];
      t.y += dy[i];
      ++t.cost;
      if(t.x < 0 || t.x >= W) continue;
      if(t.y < 0 || t.y >= H) continue;
      if(G[t.y][t.x] == 7) continue;
      switch(i) {
      case 0:
	t.face[0] = 7 - s.face[2];
	t.face[2] = s.face[0];
	break;
      case 1:
	t.face[0] = s.face[1];
	t.face[1] = 7 - s.face[0];
	break;
      case 2:
	t.face[0] = s.face[2];
	t.face[2] = 7 - s.face[0];
	break;
      case 3:
	t.face[0] = 7 - s.face[1];
	t.face[1] = s.face[0];
	break;
      }
      if(G[t.y][t.x] != 0 && G[t.y][t.x] != t.face[0]) continue;
      if(vis[t.y][t.x][t.step][t.face[0]][t.face[1]][t.face[2]]) continue;
      vis[t.y][t.x][t.step][t.face[0]][t.face[1]][t.face[2]] = true;
      que.push(t);
    }
  }
  return -1;
}

int main() {
  id['w'] = 0;
  id['r'] = 1;
  id['g'] = 2;
  id['b'] = 3;
  id['y'] = 4;
  id['m'] = 5;
  id['c'] = 6;
  id['k'] = 7;
  while((cin >> W >> H) && (W || H)) {
    int sx, sy;
    char c;
    for(int i = 0; i < H; ++i) {
      for(int j = 0; j < W; ++j) {
	cin >> c;
	if(c == '#') {
	  sx = j, sy = i;
	  c = 'w';
	}
	G[i][j] = id[c];
      }
    }
    for(int i = 0; i < 6; ++i) {
      cin >> c;
      order[i] = id[c];
    }
    int ans = bfs(sx, sy);
    if(ans == -1) cout << "unreachable" << endl;
    else cout << ans << endl;
  }
  return 0;
}