#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>


using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return n ? __builtin_popcount(n) : 0; }
template <> int popcount(int n) { return n ? __builtin_popcount(n) : 0; }
template <> int popcount(unsigned long long n) { return n ? __builtin_popcountll(n) : 0; }
template <> int popcount(long long n) { return n ? __builtin_popcountll(n) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))

#define rep(i, n) for (int i = 0; i < n; ++i)

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

typedef long long ll;
typedef pair<int, int> pint;

const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }



struct P
{
	int x, y, f, c;
	P(int x, int y, int f, int c)
		: x(x), y(y), f(f), c(c) { }
	bool operator<(const P& a) const { return c > a.c; }
};
int main()
{
	ios::sync_with_stdio(false);

	int w, h;
	char s[64][64];
	while (cin >> w >> h, w)
	{
		for (int y = 0; y < h; ++y)
			for (int x = 0; x < w; ++x)
				cin >> s[y][x];

		static int dp[64][64][2];
		const int INF = 1 << 26;
		for (int y = 0; y < h; ++y)
			for (int x = 0; x < w; ++x)
				dp[y][x][0] = dp[y][x][1] = INF;

		priority_queue<P> q;
		for (int y = 0; y < h; ++y)
		{
			for (int x = 0; x < w; ++x)
			{
				if (s[y][x] == 'S')
				{
					dp[y][x][0] = dp[y][x][1] = 0;
					q.push(P(x, y, 0, 0));
					q.push(P(x, y, 1, 0));
				}
			}
		}
		while (!q.empty())
		{
			P cur = q.top(); q.pop();
			int x = cur.x, y = cur.y, f = cur.f, c = cur.c;
			if (c > dp[y][x][f])
				continue;

			int dir = f == 0 ? 1 : -1;
			int nf = f ^ 1;
			for (int dy = -2; dy <= 2; ++dy)
			{
				for (int dx = 1; dx <= 3; ++dx)
				{
					int tx = x + dir * dx, ty = y + dy;
					if (abs(dx) + abs(dy) <= 3
						&& valid_pos(tx, ty, w, h) && s[ty][tx] != 'X')
					{
						int nc = c;
						if (isdigit(s[ty][tx]))
							nc += s[ty][tx] - '0';
						if (nc < dp[ty][tx][nf])
						{
							dp[ty][tx][nf] = nc;
							q.push(P(tx, ty, nf, nc));
						}
					}
				}
			}
		}

		int res = INF;
		for (int y = 0; y < h; ++y)
			for (int x = 0; x < w; ++x)
				if (s[y][x] == 'T')
					for (int i = 0; i < 2; ++i)
						min_swap(res, dp[y][x][i]);
		if (res == INF)
			res = -1;
		cout << res << endl;
	}
}

Measured memory_bytes: 960