#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const int N = 2e7 + 2;

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

char arr[755][755];
int freq[755][755], n, m;
bool vis[755][755];
pair<int, int> target, rock;
queue<pair<int, int>> q;

bool valid(int i, int j){
    return (i >= 0 && j >= 0 && i < n && j < m);
}

int sign(int x){
    if(x < 0)
        return -1;
    else
        return 1;
}

void moveDir(int r, int c, int r1, int c1, int r2, int c2){
    for(int i = r1; i != r2; i += sign(r2 - r1)){
        for(int j = c1; j != c2; j += sign(c2 - c1)){
            if(vis[i][j])
                continue;
            if(!vis[i][j] && !freq[i][j]){
                vis[i][j] = true;
                q.push({i, j});
                if(arr[i][j] == 'K'){
//                    q.push({r, c});
                    for(int k = 0; k < 8; k++){
                        int ii = i + dx[k];
                        int jj = j + dy[k];
                        if(valid(ii, jj)) {
                            freq[ii][jj]--;
                            arr[ii][jj] = '.';
                        }
                        if(!freq[ii][jj])
                            q.push(rock);
                    }
                    return;
                }
            }
            if(arr[i][j] == 'K')
                return;
        }
    }
}

int main() {
    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] == 'R')
                rock = {i, j};
            if(arr[i][j] == 'T')
                target = {i, j};
            if(arr[i][j] == 'K'){
                for(int x = 0; x < 8; x++){
                    int ii = i + dx[x];
                    int jj = j + dy[x];
                    if(valid(ii, jj))
                        freq[ii][jj]++;
                }
            }
        }
    }
    q.push(rock);
    vis[rock.first][rock.second] = true;
    while(q.size()){
        pair<int, int> p = q.front();
        q.pop();
        if(p == target){
            return cout<<"yes", 0;
        }
        int x = p.first, y = p.second;
        // move right
        moveDir(x, y, x, y + 1, x + 1, m);
        // mve left
        moveDir(x, y, x, y - 1, x + 1, -1);
        // move up
        moveDir(x, y, x - 1, y, -1, y + 1);
        // move down
        moveDir(x, y, x + 1, y, n, y + 1);
    }
    cout<<"no";
    return 0;
}