#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e3 + 5;
int n, m, attacked[N][N];
int dxK[] = {1, 1, -1, -1, 2, 2, -2, -2};
int dyK[] = {2, -2, 2, -2, 1, -1, 1, -1};
int dxR[] = {1, -1, 0, 0};
int dyR[] = {0, 0, 1, -1};
bool valid[N][N];
char a[N][N];
queue<pair<int, int>> q;
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0;i < n;i++) {
        for(int j = 0;j < m;j++) {
            cin >> a[i][j];
            if(a[i][j] == 'R') {
                valid[i][j] = true;
                q.push({i, j});
            }
        }
    }
    for(int i = 0;i < n;i++) {
        for(int j = 0;j < m;j++) {
            if(a[i][j] != 'K')
                continue;
            for(int k = 0;k < 8;k++) {
                int ni = i + dxK[k];
                int nj = j + dyK[k];
                if(ni >= 0 && ni < n && nj >= 0 && nj < m)
                    attacked[ni][nj]++;
            }
        }
    }
    while(!q.empty()) {
        int i = q.front().first;
        int j = q.front().second;
        q.pop();
        if(a[i][j] == 'T')
            return cout << "yes", 0;
        if(a[i][j] == 'K') {
            for(int k = 0;k < 8;k++) {
                int ni = i + dxK[k];
                int nj = j + dyK[k];
                if(ni >= 0 && ni < n && nj >= 0 && nj < m) {
                    attacked[ni][nj]--;
                    if(attacked[ni][nj] == 0) {
                        bool ok = false;
                        for(int p = 0;p < 4 && !ok;p++) {
                            int x = ni, y = nj;
                            while(1) {
                                x += dxR[p];
                                y += dyR[p];
                                if(x < 0 || x >= n || y < 0 || y >= m)
                                    break;
                                if(valid[x][y]) {
                                    ok = true;
                                    break;
                                }
                                if(a[x][y] == 'K')
                                    break;
                            }
                        }
                        if(ok) {
                            q.push({ni, nj});
                            valid[ni][nj] = true;
                        }
                    }
                }
            }
        }
        for(int k = 0;k < 4;k++) {
            int ni = i, nj = j;
            while(1) {
                ni += dxR[k];
                nj += dyR[k];
                if(ni < 0 || ni >= n || nj < 0 || nj >= m || valid[ni][nj])
                    break;
                if(!attacked[ni][nj]) {
                    q.push({ni, nj});
                    valid[ni][nj] = true;
                }
                if(a[ni][nj] == 'K')
                    break;
            }
        }
    }
    cout << "no";
    return 0;
}