#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) (a).begin(),(a).end()
#define ifnot(a) if(not a)
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

void reader(int &a) { scanf("%d", &a); }
void reader(double &a) { scanf("%lf", &a); }
void reader(char a[]) { scanf("%s", a); }
void reader(char &a) { scanf(" %c", &a); }
void reader(ll &a) { scanf("%lld", &a); }
void reader(ull &a) { scanf("%llu", &a); }
// void reader(string& a){cin >> a;};
template<class T, class U> void reader(T& t, U& u) { reader(t); reader(u); }
template<class T, class U, class V> void reader(T& t, U& u, V& v) { reader(t); reader(u); reader(v); }

void writer(const int a, char c) { printf("%d", a); putchar(c); }
void writer(const ll a, char c) { printf("%lld", a); putchar(c); }
void writer(const ull a, char c) { printf("%llu", a); putchar(c); }
void writer(const double a, char c) { printf("%.20lf", a); putchar(c); }
void writer(const char a[]) { printf("%s", a); };
void writer(const char a[], char c) { printf("%s", a); putchar(c); };
void writer(const char a, char c) { putchar(a); putchar(c); };
template<class T> void writerLn(T t) { writer(t, '\n'); }
template<class T, class U> void writerLn(T t, U u) { writer(t, ' '); writer(u, '\n'); }
template<class T, class U, class V> void writerLn(T t, U u, V v) { writer(t, ' '); writer(u, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { int i; if (!n) { putchar('\n'); return; }rep(i, n - 1) writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerVec(vector<T> x) { int n = x.size(); int i; if (!n) { putchar('\n'); return; }rep(i, n - 1) writer(x[i], ' '); writer(x[n - 1], '\n'); }

vector<string> split(const string &str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); }return v; }
// #define int ll
bool test = 0;
int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
#define MAX 35

int w, h;
int s[MAX][MAX];
int dp[MAX][MAX];
int cost[MAX][MAX][4];
int c[4];
struct Point {
	int y, x, dir, cost;
};
//bool next_flag(Point& now) {
//	int i;
//	bool flag = false;
//	rep(i, 4) {
//		int ny = now.y + dy[i];
//		int nx = now.x + dx[i];
//		if (ny < 0 || h <= ny) continue;
//		if (nx < 0 || w <= nx) continue;
//		if (cost[ny][nx] > cost[now.y][now.x]) flag = true;
//	}
//	return flag;
//}
int ddir[] = { 0,3,2,1 };
void bfs() {
	int i, j, k;
	rep(i, h) rep(j, w) rep(k, 4) cost[i][j][k] = INT_MAX;
	queue<Point> q;
	q.push({ 0,0,1,0 });
	cost[0][0][1] = 0;
	while (q.size()) {
		Point now = q.front(); q.pop();
		rep(i, 4) {
			int ndir = (now.dir + ddir[i]) % 4;
			int ny = now.y + dy[ndir];
			int nx = now.x + dx[ndir];
			if (ny < 0 || h <= ny) continue;
			if (nx < 0 || w <= nx) continue;

			int ncost = now.cost;
			if (s[now.y][now.x] != i) ncost += c[i];

			if (ncost < cost[ny][nx][ndir]) {
				cost[ny][nx][ndir] = ncost;
				q.push({ ny,nx,ndir,ncost });
			}
		}
	}
}

signed main(void)
{
	int i, j, k;
	while (1) {
		cin >> w >> h;
		if (w == 0) return 0;
		rep(i, h) rep(j, w) reader(s[i][j]);
		rep(i, 4) reader(c[i]);
		bfs();
		int ans = INT_MAX;
		rep(i, 4) {
			if (cost[h - 1][w - 1][i] < ans) {
				ans = cost[h - 1][w - 1][i];
			}
		}
		cout << ans << endl;
	}
	return 0;
}

Measured memory_bytes: 3364