#include <bits/stdc++.h>
using namespace std;

// template {{{
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

void solver(int w, int h) {
    auto ss = make_vector(h, w, '.');
    range(i, 0, h) range(j, 0, w) cin >> ss[i][j];

    auto as = make_vector(h, w, 0);
    vector< pair< int, int > > st, gl;
    int lx, ly, rx, ry;
    range(i, 0, h) range(j, 0, w) {
        if (ss[i][j] == 'X') {
            as[i][j] = -1;
        } else if (ss[i][j] == 'S') {
            st.emplace_back(i, j);
        } else if (ss[i][j] == 'T') {
            gl.emplace_back(i, j);
        } else {
            as[i][j] = ss[i][j] - '0';
        }
    }

//    for (auto a: as) cerr << a << endl;

    auto dijkstra = [&](int y, int x, bool is_right) {
        auto dist = make_vector(h, w, 2, inf);

        dist[y][x][is_right] = 0;
        using pq_type = pair< int, pair< pair< int, int >, bool> >;
        priority_queue< pq_type, vector<pq_type>, greater<pq_type>> pq;
        pq.emplace(0, make_pair(make_pair(y, x), is_right));

        while (!pq.empty()) {
            auto cur = pq.top();
            pq.pop();

            int cy = cur.second.first.first;
            int cx = cur.second.first.second;
            bool pre_right = cur.second.second;

//            cerr << make_pair(cy, cx) << endl;

            if (cur.first > dist[cy][cx][pre_right]) continue;

            range(dy, -3, 4) range(dx, -3, 4) {
                int ny = cy + dy;
                int nx = cx + dx;

                if (nx < 0 || w <= nx || ny < 0 || h <= ny) continue; 
                if (abs(nx - cx) + abs(ny - cy) > 3) continue;

                if (pre_right && nx >= cx) continue; 
                if (!pre_right && nx <= cx) continue;

                if (as[ny][nx] == -1) continue;

                if (dist[ny][nx][!pre_right] > dist[cy][cx][pre_right] + as[ny][nx]) {
                    dist[ny][nx][!pre_right] = dist[cy][cx][pre_right] + as[ny][nx];
                    pq.emplace(dist[ny][nx][!pre_right], make_pair(make_pair(ny, nx), !pre_right));
                }
            }
        }

        int res = inf;
        for (auto p: gl) {
            chmin(res, dist[p.first][p.second][0]);
            chmin(res, dist[p.first][p.second][1]);
        }

        return res;
    };

    int ans = inf;
    for (auto p: st) {
        chmin(ans, dijkstra(p.first, p.second, true));
        chmin(ans, dijkstra(p.first, p.second, false));
    }

    if (ans == inf) {
        cout << -1 << endl;
    } else {
        cout << ans << endl;
    }
}

signed main(int argc, char *argv[]) {
    int h, w;
    while (cin >> w >> h, w) {
        solver(w, h);
    }
}



Measured memory_bytes: 3288