#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

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

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

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	vector<string> a(n);
	for (int i = 0; i < n; i ++) cin >> a[i];
	int attack[n][m], vis[n][m];
	memset(attack, 0, sizeof(attack));
	memset(vis, 0, sizeof(vis));
	pi s, e;
	for (int i = 0; i < n; i ++){
		for (int j = 0; j < m; j ++){
			if (a[i][j] == 'K'){
				for (int k = 0; k < 8; k ++){
					int ni = i + dx[k];
					int nj = j + dy[k];
					if (ingrid(ni, nj)){
						attack[ni][nj] ++;
					}
				}
			}
			if (a[i][j] == 'R'){
				s = {i, j};
			}
			if (a[i][j] == 'T'){
				e = {i, j};
			}
		}
	}
	queue<pi> que;
	que.push(s);
	vis[s.fi][s.se] = 1;
	while(! que.empty()){
		pi cur = que.front(); que.pop();
		int r = cur.fi, c = cur.se;
		//cout << r << ' ' << c << '\n';
		for (int i = r - 1; i >= 0; i --){
			if (a[i][c] == 'K' && attack[i][c] != 0) break;
			if (! vis[i][c] && attack[i][c] == 0){
				vis[i][c] = 1;
				que.push({i, c});
			}
		}
		for (int i = r + 1; i < n; i ++){
			if (a[i][c] == 'K' && attack[i][c] != 0) break;
			if (! vis[i][c] && attack[i][c] == 0){
				vis[i][c] = 1;
				que.push({i, c});
			}
		}
		for (int j = c - 1; j >= 0; j --){
			if (a[r][j] == 'K' && attack[r][j] != 0) break;
			if (! vis[r][j] && attack[r][j] == 0){
				vis[r][j] = 1;
				que.push({r, j});
			}
		}
		for (int j = c + 1; j < m; j ++){
			if (a[r][j] == 'K' && attack[r][j] != 0) break;
			if (! vis[r][j] && attack[r][j] == 0){
				vis[r][j] = 1;
				que.push({r, j});
			}
		}
		if (a[r][c] == 'K'){
			a[r][c] = '.';
			for (int k = 0; k < 8; k ++){
				int nr = r + dx[k];
				int nc = c + dy[k];
				if (ingrid(nr, nc)){
					attack[nr][nc] --;
					if (attack[nr][nc] == 0){
						bool havevis = false;
						for (int i = nr - 1; i >= 0; i --){
							if (a[i][nc] == 'K') break;
							if (vis[i][nc]) havevis = true;
						}
						for (int i = nr + 1; i < n; i ++){
							if (a[i][nc] == 'K') break;
							if (vis[i][nc]) havevis = true;
						}
						for (int j = nc - 1; j >= 0; j --){
							if (a[nr][j] == 'K') break;
							if (vis[nr][j]) havevis = true;
						}
						for (int j = nc + 1; j < m; j ++){
							if (a[nr][j] == 'K') break;
							if (vis[nr][j]) havevis = true;
						}
						if (havevis){
							vis[nr][nc] = 1;
							que.push({nr, nc});
						}
					}
				}
			}
		}
	}
	cout << (vis[e.fi][e.se] ? "yes" : "no");
}