#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.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; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

class Pos {
public:
  int i, j, k;
  Pos(int i, int j, int k):i(i), j(j), k(k){}

  bool operator<(const Pos &another) const
  {
    return i < another.i;
  };
  
};

#define P pair<int, Pos>

int main() {
  while (true) {
    int w, h;
    cin >> w >> h;
    if (w == 0 && h == 0) return 0;
    vii a(h + 2, vi(w + 2, -1));
    rep1 (i, h) rep1 (j, w) cin >> a[i][j];
    vi c(4);
    rep (i, 4) cin >> c[i];

    vector<vii> d(h + 2, vii(w + 2, vi(4, inf)));
    rep (k, 4) {
      rep (i, h + 2) d[i][0][k] = d[i][w + 1][k] = -inf;
      rep (i, w + 2) d[0][i][k] = d[h + 1][i][k] = -inf;
    }

    d[1][1][1] = 0;
    P now = {0, Pos(1, 1, 1)};
    priority_queue<P, vector<P>, greater<P> > pq;
    pq.push(now);
    while (!pq.empty()) {
      P now = pq.top();
      pq.pop();
      int cost = now.first, i0 = now.second.i, j0 = now.second.j, k0 = now.second.k;
      int nk;
      
      rep (k, 4) {
        int nc = cost;
        if (k != a[i0][j0]) nc += c[k];
        int nk = (k0 + k) % 4;
        int ni = i0 + dx[nk], nj = j0 + dy[nk];

        if (d[ni][nj][nk] > nc) {
          d[ni][nj][nk] = nc;
          pq.push({nc, Pos(ni, nj, nk)});
        }
      }
    }
    int ans = inf;
    rep (k, 4) {
      chmin(ans, d[h][w][k]);
    }
    cout << ans << endl;
  }
}



Measured memory_bytes: 3244