#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n,m,sr,sc,tr,tc;
char arr[1005][1005];
bool v[1005][1005];

int x[] = {0,0,1,-1};
int y[] = {1 ,-1,0,0};
//left 1
//right 2
//up 3
//down 4


bool isValid(int r,int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}

bool isChanged(int r,int c, int nr,int nc,int direct){
    if(nc == c+1 && direct == 2)
        return false;
    if(nr == r+1 && direct == 4)
        return false;
    if(nc == c-1 && direct == 1)
        return false;
    if(nr == r-1 && direct == 3)
        return false;
    return true;
}

int getNewDirection(int r,int c,int nr, int nc){
    if(nc == c+1)
        return 2;
    if(nr == r+1)
        return 4;
    if(nc == c-1)
        return 1;
    if(nr == r-1)
        return 3;
}


void DFS(int r,int c,int turn,int direc){
    if(r == tr && c == tc){
        cout<<"YES";
        exit(0);
    }
    v[r][c] = true;
    int nr,nc;
    for(int i = 0 ; i < 4 ; ++i){
        nr = r + x[i];
        nc = c + y[i];
        if(!v[nr][nc] && isValid(nr,nc) && arr[nr][nc] != '*'){
            int newDir = direc;
            int neTurns = turn;
            if(isChanged(r,c,nr,nc,direc)){
                if(turn == 2){
                    return ;
                }
                newDir = getNewDirection(r,c,nr,nc);
                neTurns++;
            }
            DFS(nr,nc,neTurns,newDir);
        }
    }
}




int main()
{
   // freopen("omar.in","r",stdin);
    cin>>n>>m;
    for(int i = 0 ; i < n ; ++i){
        for(int  j = 0 ; j < m ;++j){
            cin>>arr[i][j];
            if(arr[i][j] == 'S'){
                sr = i;
                sc = j;
            }else if(arr[i][j] == 'T'){
                tr = i ;
                tc = j;
            }
        }
    }
    DFS(sr,sc,0,1);
    memset(v,0,sizeof(v));
    DFS(sr,sc,0,2);
    memset(v,0,sizeof(v));
    DFS(sr,sc,0,3);
    memset(v,0,sizeof(v));
    DFS(sr,sc,0,4);
    cout<<"NO";
    return 0;
}