#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 777;
string grid[N];
int cnt[N][N];

set<int> horsesRow[N], horsesCol[N];
set<int> freeRow[N], freeCol[N];


int n, m;

struct DSU
{
	VI p, sz;
	vector<VI> horses;
	
	void init()
	{
		p.resize(n * m);
		iota(ALL(p), 0);
		sz.assign(n * m, 1);
		
		horses.resize(n * m);
		FOR(i, 0, n)
			FOR(j, 0, m)
				if(grid[i][j] == 'K')
					horses[i * m + j].PB(i * m + j);
	}
	
	int par(int v)
	{
		if(p[v] == v)
			return v;
		return p[v] = par(p[v]);
	}
	bool merge(int u, int v)
	{
		u = par(u);
		v = par(v);
		if(u == v)
			return false;
		
		if(sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		
		if(SZ(horses[v]) < SZ(horses[u]))
			swap(horses[v], horses[u]);
		horses[v].insert(horses[v].end(), ALL(horses[u]));
		
		
		return true;
	}
}dsu;

int dx[8] = {-1, -1, 1, 1, -2, -2, 2, 2};
int dy[8] = {-2, 2, -2, 2, -1, 1, -1, 1};
bool ok(int i, int j)
{
	return 0 <= i && i < n && 0 <= j && j < m;
}


void add(int i, int j)
{
	freeRow[i].insert(j);
	freeCol[j].insert(i);
	
	auto freeIt = freeRow[i].upper_bound(j);
	auto horseIt = horsesRow[i].upper_bound(j);	
	if(freeIt != freeRow[i].end() && (horseIt == horsesRow[i].end() || *freeIt < *horseIt))
		dsu.merge(i * m + j, i * m + (*freeIt));

	freeIt = freeRow[i].lower_bound(j);
	horseIt = horsesRow[i].lower_bound(j);	
	if(freeIt != freeRow[i].begin() && (horseIt == horsesRow[i].begin() || *prev(freeIt) > *prev(horseIt)))
		dsu.merge(i * m + j, i * m + (*prev(freeIt)));


	freeIt = freeCol[j].upper_bound(i);
	horseIt = horsesCol[j].upper_bound(i);	
	if(freeIt != freeCol[j].end() && (horseIt == horsesCol[j].end() || *freeIt < *horseIt))
		dsu.merge(i * m + j, (*freeIt) * m + j);

	freeIt = freeCol[j].lower_bound(i);
	horseIt = horsesCol[j].lower_bound(i);	
	if(freeIt != freeCol[j].begin() && (horseIt == horsesCol[j].begin() || *prev(freeIt) > *prev(horseIt)))
		dsu.merge(i * m + j, (*prev(freeIt)) * m + j);
}




int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	cin >> n >> m;
	FOR(i, 0, n)
		cin >> grid[i];
	dsu.init();
		
	FOR(i, 0, n)
	{
		FOR(j, 0, m)
		{
			if(grid[i][j] != 'K')
				continue;
			
			FOR(it, 0, 8)
			{
				int ni = i + dx[it], nj = j + dy[it];
				if(ok(ni, nj))
					cnt[ni][nj]++;
			}
		}
	}
	int start = -1, target = -1;
	FOR(i, 0, n)
	{
		FOR(j, 0, m)
		{
			if(cnt[i][j] == 0)
			{
				freeRow[i].insert(j);
				freeCol[j].insert(i);
			}
			else
			{
				if(grid[i][j] == 'K')
				{
					horsesRow[i].insert(j);
					horsesCol[j].insert(i);
				}
			}
		}
	}
	FOR(i, 0, n)
	{
		FOR(j, 0, m)
		{
			if(cnt[i][j] == 0)
				add(i, j);
			if(grid[i][j] == 'R')
				start = i * m + j;
			if(grid[i][j] == 'T')
				target = i * m + j;
		}
	}
	while(true)
	{
		if(dsu.par(start) == dsu.par(target))
			break; 
		int v = dsu.par(start);
		if(SZ(dsu.horses[v]) == 0)
			break;
		VI horses = dsu.horses[v];
		dsu.horses[v].clear();
		
		for(int horse : horses)
		{
			int i = horse / m;
			int j = horse % m;
			
			FOR(it, 0, 8)
			{
				int ni = i + dx[it], nj = j + dy[it];
				if(!ok(ni, nj))
					continue;
				cnt[ni][nj]--;
				if(cnt[ni][nj] == 0)
				{
					add(ni, nj);
				}
			}
		}
	}
	if(dsu.par(start) == dsu.par(target))
		cout << "yes\n";
	else
		cout << "no\n";
	
	
	
	
	



	
	return 0;
}