#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
  i >> p.first >> p.second;
  return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
  for (auto& v : t) {
    i >> v;
  }
  return i;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {
  o << p.first << ' ' << p.second;
  return o;
}
template <typename T>
std::ostream& operator<<(std::ostream& o, const vector<T>& t) {
  if (t.empty()) o << '\n';
  for (size_t i = 0; i < t.size(); ++i) {
    o << t[i] << " \n"[i == t.size() - 1];
  }
  return o;
}
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
bool in(T a, T b, T c) {
  return a <= b && b < c;
}
unsigned int logceil(long long first) {
  return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;
}
namespace std {
template <typename T, typename U>
struct hash<pair<T, U>> {
  hash<T> t;
  hash<U> u;
  size_t operator()(const pair<T, U>& p) const {
    return t(p.first) ^ (u(p.second) << 7);
  }
};
}  // namespace std
template <typename T, typename F>
T bsh(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      l = m + 1;
      r = m;
    } else {
      h = m - 1;
    }
  }
  return r;
}
template <typename F>
double bshd(double l, double h, const F& f, double p = 1e-9) {
  unsigned int r = 3 + (unsigned int)log2((h - l) / p);
  while (r--) {
    double m = (l + h) / 2;
    if (f(m)) {
      l = m;
    } else {
      h = m;
    }
  }
  return (l + h) / 2;
}
template <typename T, typename F>
T bsl(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      h = m - 1;
      r = m;
    } else {
      l = m + 1;
    }
  }
  return r;
}
template <typename F>
double bsld(double l, double h, const F& f, double p = 1e-9) {
  unsigned int r = 3 + (unsigned int)log2((h - l) / p);
  while (r--) {
    double m = (l + h) / 2;
    if (f(m)) {
      h = m;
    } else {
      l = m;
    }
  }
  return (l + h) / 2;
}
template <typename T>
T gcd(T a, T b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
template <typename T>
class vector2 : public vector<vector<T>> {
 public:
  vector2() {}
  vector2(size_t a, size_t b, T t = T())
      : vector<vector<T>>(a, vector<T>(b, t)) {}
};
template <typename T>
class vector3 : public vector<vector2<T>> {
 public:
  vector3() {}
  vector3(size_t a, size_t b, size_t c, T t = T())
      : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}
};
template <typename T>
class vector4 : public vector<vector3<T>> {
 public:
  vector4() {}
  vector4(size_t a, size_t b, size_t c, size_t d, T t = T())
      : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}
};
template <typename T>
class vector5 : public vector<vector4<T>> {
 public:
  vector5() {}
  vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())
      : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}
};
class CCirclingRoundTreasures {
 public:
  void solve(istream& cin, ostream& cout) {
    int N, M;
    cin >> N >> M;
    vector<string> A(N);
    cin >> A;
    std::pair<int, int> S;
    vector2<int> I(N, M, 0);
    int b = 0, t = 0;
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < M; ++j) {
        if (A[i][j] == 'B') {
          ++b;
        } else if (A[i][j] == 'S') {
          S = {i, j};
          A[i][j] = '.';
        } else if (A[i][j] >= '1' && A[i][j] <= '8') {
          ++t;
        }
      }
    }
    b = 0;
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < M; ++j) {
        if (A[i][j] == 'B') {
          I[i][j] = 1 << (t + (b++));
        } else if (A[i][j] >= '1' && A[i][j] <= '8') {
          I[i][j] = 1 << (A[i][j] - '1');
        }
      }
    }
    int L = b + t;
    vector<int> X(t);
    cin >> X;
    vector<vector<int>> E(N * M << L);
    auto idx = [&](int a, int b, int c) { return c + (a + b * N << L); };
    for (int i = 0; i < N; ++i) {
      int leftMe = 0;
      int leftDown = 0;
      for (int j = 0; j < M; ++j) {
        for (int k = 0; k < (1 << L); ++k) {
          int id = idx(i, j, k);
          if (i != 0 && A[i - 1][j] == '.') {
            E[id].push_back(idx(i - 1, j, k ^ leftMe));
          }
          if (i != N - 1 && A[i + 1][j] == '.') {
            E[id].push_back(idx(i + 1, j, k ^ leftDown));
          }
          if (j != 0 && A[i][j - 1] == '.') {
            E[id].push_back(id - (N << L));
          }
          if (j != M - 1 && A[i][j + 1] == '.') {
            E[id].push_back(id + (N << L));
          }
        }
        leftMe |= I[i][j];
        if (i != N - 1) leftDown |= I[i + 1][j];
      }
    }
    vector<int> D(N * M << L, 10000);
    D[idx(S.first, S.second, 0)] = 0;
    vector<int> Q{idx(S.first, S.second, 0)};
    for (int i = 0; i < Q.size(); ++i) {
      for (int j : E[Q[i]]) {
        if (D[j] == 10000) {
          D[j] = D[Q[i]] + 1;
          Q.push_back(j);
        }
      }
    }
    int ans = 0;
    for (int i = 0; i < (1 << t); ++i) {
      int cur = 0;
      for (int j = 0; j < t; ++j) {
        if (i & 1 << j) cur += X[j];
      }
      ans = max(ans, cur - D[idx(S.first, S.second, i)]);
    }
    cout << ans << '\n';
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  CCirclingRoundTreasures solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
