#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cout << '{';
  __print(x.first);
  cout << ',';
  __print(x.second);
  cout << '}';
}
template <typename T>
void __print(const T &x) {
  int first = 0;
  cout << '{';
  for (auto &i : x) cout << (first++ ? "," : ""), __print(i);
  cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cout << ", ";
  _print(v...);
}
template <class T>
void remdup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), end(v));
}
template <typename T>
struct cmp {
  bool operator()(const T &p1, const T &p2) {}
};
const long long N = 2e5 + 100;
const long long mod = 1e9 + 7;
const long long X = 2e5 + 100;
vector<pair<long long, long long>> dire = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
long long r, c;
string s[1002];
long long check[1005][10005];
pair<long long, long long> start, endd;
vector<pair<long long, long long>> fight;
long long dist;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ;
  cin >> r >> c;
  for (long long i = (0); i < (r); ++i) cin >> s[i];
  for (long long i = (0); i < (r); ++i)
    for (long long j = (0); j < (c); ++j) {
      if (s[i][j] == 'S') {
        start = {i, j};
        check[i][j] = 0;
      } else if (s[i][j] == 'E') {
        endd = {i, j};
        check[i][j] = 0;
      } else if (s[i][j] == 'T')
        check[i][j] = -1;
      else
        check[i][j] = (s[i][j] - '0');
    }
  queue<pair<pair<long long, long long>, long long>> qq;
  qq.push({endd, 0});
  check[endd.first][endd.second] = -1;
  while (((long long)(qq.size())) != 0) {
    pair<pair<long long, long long>, long long> x;
    x = qq.front();
    qq.pop();
    if (x.first == start) dist = x.second;
    for (long long i = (0); i < (((long long)(dire.size()))); ++i) {
      long long f1 = x.first.first + dire[i].first;
      long long f2 = x.first.second + dire[i].second;
      if (f1 < 0 || f1 >= r || f2 < 0 || f2 >= c) continue;
      if (check[f1][f2] == -1) continue;
      if (check[f1][f2] > 0) fight.push_back({check[f1][f2], x.second + 1});
      check[f1][f2] = -1;
      qq.push({{f1, f2}, x.second + 1});
    }
  }
  long long ans = 0;
  for (long long i = (0); i < (((long long)(fight.size()))); ++i)
    if (fight[i].second <= dist) ans += fight[i].first;
  cout << ans << "\n";
  return 0;
}
