#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1LL << 62;
const unsigned long long ulinf = 1ULL << 63;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T a) {
  return a >= 0 ? a : -a;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
T addmod(T a, T b, T c) {
  return (T)mod((long long)a + b, (long long)c);
}
template <class T>
T mulmod(T a, T b, T c) {
  return (T)mod((long long)a * b, (long long)c);
}
template <class T>
T powmod(T a, T b, T c) {
  return (T)mod(
      b ? mulmod(mod(sqr((long long)powmod(a, b >> 1, c)), (long long)c),
                 (b & 1LL) ? a : 1LL, (long long)c)
        : 1LL,
      (long long)c);
}
template <class T>
void maxe(T &a, T b) {
  a = max(a, b);
}
template <class T>
void mine(T &a, T b) {
  a = min(a, b);
}
template <class T>
void mode(T &a, T b) {
  a = mod(a, b);
}
template <class T>
void addmode(T &a, T b, T c) {
  a = addmod(a, b, c);
}
template <class T>
void mulmode(T &a, T b, T c) {
  a = mulmod(a, b, c);
}
template <class T>
void powmode(T &a, T b, T c) {
  a = powmod(a, b, c);
}
int iszero(double a) { return abs(a) <= eps; }
template <class T>
void geti(T &a) {
  a = 0;
  int b = 1, c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 1111;
int test;
int n, m, k, ans;
char s[N][N];
int a[N][N], b[N][N], d[N][N];
int sx, sy, ex, ey;
int qx[4 * N * N], qy[4 * N * N], head, tail, inq[N][N];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
void push(int x, int y) {
  tail++;
  qx[tail] = x;
  qy[tail] = y;
  inq[x][y] = 1;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s[i] + 1);
    for (int j = 1; j <= m; j++) {
      d[i][j] = inf;
      if (s[i][j] != 'T') {
        a[i][j] = 1;
        if (s[i][j] == 'S') {
          sx = i;
          sy = j;
        } else {
          if (s[i][j] == 'E') {
            ex = i;
            ey = j;
          } else {
            b[i][j] = s[i][j] - '0';
          }
        }
      }
    }
  }
  d[ex][ey] = 0;
  head = 1;
  tail = 0;
  push(ex, ey);
  while (head <= tail) {
    int x = qx[head], y = qy[head];
    for (int i = 0; i < 4; i++) {
      int xx = x + dx[i], yy = y + dy[i];
      if (a[xx][yy] && d[xx][yy] > d[x][y] + 1) {
        d[xx][yy] = d[x][y] + 1;
        if (!inq[xx][yy]) push(xx, yy);
      }
    }
    inq[x][y] = 0;
    head++;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (d[i][j] <= d[sx][sy]) ans += b[i][j];
  printf("%d\n", ans);
  return 0;
}
