#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) container.begin(), container.end()
#define RALL(container) container.rbegin(), container.rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;

enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
  dice():id(6) {
    id[TOP] = 0; id[FRONT] = 1; id[LEFT] = 2;
    id[RIGHT] = 3; id[BACK] = 4; id[BOTTOM] = 5;
  }
  dice(int hash):id(6) {
    for(int i=5;i>=0;i--){
    	id[i] = hash%6;
    	hash/=6;
    }
  }
  int& operator[] (FACE f) { return id[f]; }
  void roll_x() { roll(TOP, BACK, BOTTOM, FRONT); }
  void roll_y() { roll(TOP, LEFT, BOTTOM, RIGHT); }
  void roll_z() { roll(FRONT, RIGHT, BACK, LEFT); }
  void roll_bx() { roll(FRONT, BOTTOM, BACK, TOP); }
  void roll_by() { roll(RIGHT, BOTTOM, LEFT, TOP); }
  vector<int> all_rolls() {
    vector<int> ret;
    for (int k = 0; k < 6; (k&1?roll_y():roll_x()),++k)
      for (int i = 0; i < 4; roll_z(), ++i)
        ret.push_back(this->toInt());
    return ret;
  }
  int toInt(){
  	int res=0;
  	REP(i, 6) res = res*6+id[i];
  	return res;
  }
  vi id;
private:
  void roll(FACE a, FACE b, FACE c, FACE d) {
    int tmp = id[a];
    id[a] = id[b]; id[b] = id[c];
    id[c] = id[d]; id[d] = tmp;
  }
};


int H, W;
string m[40];

int memo[33][33][7][24];

class DP{
public:
	int cost, x, y, vis;
	dice d;
	DP(){vis = 0;}
	DP(int xx, int yy, dice rr, int vv, int cc){
		cost = cc;x=xx;y=yy;d = rr;vis = vv;
	}
};
string col = "rmybgc";
string rot;
int d[4][2]={{1,0},{0,-1},{-1,0},{0,1}};
main(){
	dice di;
	map<int, int> DtoI;
	vi ItoD = di.all_rolls();
	REP(i, ItoD.size()) DtoI[ItoD[i]] = i;
	while(cin >> W >> H, W){
		memset(memo, 63, sizeof(memo));
		int ans;
		int sx, sy;
		REP(i, H){
			string s;
			cin >> s;
			m[i+1] = "k" + s + "k";
			REP(j, W) if(m[i+1][j+1] == '#'){
				m[i+1][j+1] = 'w';
				sx=j+1;sy=i+1;
			}
		}
		cin >> rot;
		m[0] = m[H+1] = string(W+2, 'k');
		queue<DP> dp;
		DP S;
		dp.push(DP(sx, sy, dice(), 0, 0));
		memo[sx][sy][0][dice().toInt()] = 0;
		while(!dp.empty()){
			S = dp.front();
			dp.pop();
			
			if(S.vis == 6) break;
			REP(i, 4){
				DP T=S;
				T.x += d[i][0];
				T.y += d[i][1];
				T.cost ++;
				if(m[T.y][T.x] == 'k') continue;
				if(i == 0) T.d.roll_y();
				if(i == 1) T.d.roll_bx();
				if(i == 2) T.d.roll_by();
				if(i == 3) T.d.roll_x();
				if(rot[T.vis] == m[T.y][T.x] && m[T.y][T.x] == col[T.d[TOP]]) T.vis ++;
				else if(m[T.y][T.x] != 'w') continue;
				
				if(chmin(memo[T.x][T.y][T.vis][DtoI[T.d.toInt()]], T.cost)) dp.push(T);
			}
		}
		if(S.vis == 6) cout << S.cost << endl;
		else cout << "unreachable" << endl;
	}
	return 0;
}

Measured memory_bytes: 2032