#pragma GCC optimize(3,"Ofast","inline")

 #include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 bool Finish_read;

 template<class T>inline void read(T &x){Finish_read=;x=;int f=;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*+ch-'',ch=getchar();x*=f;Finish_read=;}

 template<class T>inline void print(T x){if(x/!=)print(x/);putchar(x%+'');}

 template<class T>inline void writeln(T x){if(x<)putchar('-');x=abs(x);print(x);putchar('\n');}

 template<class T>inline void write(T x){if(x<)putchar('-');x=abs(x);print(x);}

 /*================Header Template==============*/

 const int step[][]={{,},{,},{-,},{,-}};

 char mp[][];

 string now;

 int n,m,sx,sy,ex,ey,dis[][];

 typedef pair<int,int>pii;

 #define fi first

 #define se second

 int main() {

     ios::sync_with_stdio(false);

     cin.tie(),cout.tie();

     cin>>n>>m;

     getline(cin,now);

     for(int i=;i<=*n+;++i) {

         getline(cin,now);

         for(int j=;j<=*m+;++j) {

             mp[i][j]=now[j-],dis[i][j]=1e9;

             if(mp[i][j]=='S')

                 sx=i,sy=j;

             if(mp[i][j]=='T')

                 ex=i,ey=j;

         }

     }

     queue<pii>q;

     q.push(pii(sx,sy)),dis[sx][sy]=;

     for(pii u;!q.empty();q.pop()) {

         u=q.front();

         int x=u.fi,y=u.se;

         if(x==ex&&y==ey)

             return *printf("%d\n",dis[x][y]/+);

         for(int k=;k<;++k) {

             int nx=x+step[k][],ny=y+step[k][];

             if((mp[nx][ny]==' '||mp[nx][ny]=='T')&&dis[nx][ny]>dis[x][y]+)

                 dis[nx][ny]=dis[x][y]+,q.push(pii(nx,ny));

         }

     }

     puts("TRDD Got lost...TAT");

 }