#include <bits/stdc++.h>
using namespace std;
template <typename T, size_t N>
int SIZE(const T (&t)[N]) {
  return N;
}
template <typename T>
int SIZE(const T &t) {
  return (int)t.size();
}
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
  return '"' + ((x1 < (int)s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
  string t = "";
  for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
       __iii__ <= __jjj__; ++__iii__) {
    t += b[__iii__] + '0';
  }
  return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  l_v_l_v_l++;
  string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
  l_v_l_v_l--;
  return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
  int rnk = rank<A>::value;
  string tab(t_a_b_s, ' ');
  string res = "";
  bool first = true;
  if (l_v_l_v_l == 0) res += '\n';
  res += tab + "[";
  x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
  auto l = begin(v);
  advance(l, x1);
  auto r = l;
  advance(r, (x2 - x1) + (x2 < SIZE(v)));
  for (auto e = l; e != r; e = next(e)) {
    if (!first) {
      res += ", ";
    }
    first = false;
    l_v_l_v_l++;
    if (e != l) {
      if (rnk > 1) {
        res += '\n';
        t_a_b_s = l_v_l_v_l;
      };
    } else {
      t_a_b_s = 0;
    }
    res += to_string(*e, coords...);
    l_v_l_v_l--;
  }
  res += "]";
  if (l_v_l_v_l == 0) res += '\n';
  return res;
}
void dbgm() { ; }
template <typename Heads, typename... Tails>
void dbgm(Heads H, Tails... T) {
  cerr << to_string(H) << " | ";
  dbgm(T...);
}
vector<vector<int>> grid, spgrid;
pair<int, int> start = {-1, -1};
pair<int, int> ed = {-1, -1};
int sp = (1e9 + 5);
bool check(int row, int col) {
  if (row >= grid.size() or row < 0) {
    return false;
  }
  if (col >= grid[0].size() or col < 0) {
    return false;
  }
  if (grid[row][col] != -1) {
    return true;
  }
  return false;
}
int bfs(int row, int col) {
  queue<pair<int, pair<int, int>>> q;
  q.push({0, {row, col}});
  while (!q.empty()) {
    int p = q.front().first;
    pair<int, int> now = q.front().second;
    q.pop();
    if (spgrid[now.first][now.second] != (1e9 + 5)) {
      continue;
    }
    spgrid[now.first][now.second] = p;
    if (now.first == start.first and now.second == start.second) {
      sp = p;
    }
    if (check(now.first, now.second + 1)) {
      q.push({p + 1, {now.first, now.second + 1}});
    }
    if (check(now.first + 1, now.second)) {
      q.push({p + 1, {now.first + 1, now.second}});
    }
    if (check(now.first, now.second - 1)) {
      q.push({p + 1, {now.first, now.second - 1}});
    }
    if (check(now.first - 1, now.second)) {
      q.push({p + 1, {now.first - 1, now.second}});
    }
  }
  return (1e9 + 5);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int r, c;
  cin >> r >> c;
  grid.assign(r, vector<int>(c, 0));
  spgrid.assign(r, vector<int>(c, (1e9 + 5)));
  for (int i = 0; i < r; ++i) {
    for (int j = 0; j < c; ++j) {
      char in;
      cin >> in;
      if (in >= '0' and in <= '9') {
        grid[i][j] = (int)(in - '0');
      } else if (in == 'T') {
        grid[i][j] = -1;
      } else if (in == 'S') {
        start.first = i;
        start.second = j;
      } else if (in == 'E') {
        ed.first = i;
        ed.second = j;
      }
    }
  }
  int ans = 0;
  bfs(ed.first, ed.second);
  for (int i = 0; i < r; ++i) {
    for (int j = 0; j < c; ++j) {
      if (grid[i][j] > 0 and spgrid[i][j] <= sp) {
        ans += grid[i][j];
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
