#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 2000500;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

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

int w, h;
char mp[16][64];
bool exi[16][64][4][16][64][4];

bool canr[16][64][4];
struct status {
	int x1, y1, d1, x2, y2, d2;
};
void solve() {
	rep(i, h)rep(j, w) {
		cin >> mp[i][j];
	}
	rep(i, h)rep(j, w)rep(k, 4)rep(x, h)rep(y, w)rep(l, 4) {
		exi[i][j][k][x][y][l] = false;
	}
	queue<status> q;
	rep(i, h)rep(j, w)if (mp[i][j] == 'K') {
		int d = 0;
		rep(k, 4) {
			int nx = i + dx[k];
			int ny = j + dy[k];
			if (mp[nx][ny] != '#') {
				d = k;
			}
		}
		rep(k, 4) {
			if (k == (2^d))continue;
			exi[i][j][d][i][j][k] = true;
			q.push({ i,j,d,i,j,k });
		}
	}
	while (!q.empty()) {
		status s = q.front(); q.pop();
		int x1 = s.x1;
		int y1 = s.y1;
		int d1 = s.d1;
		/*if (s.x1 == 6 && s.y1 == 10) {
			cout << s.d1 << endl;
		}*/
		/*if (s.x2 == 4 && s.y2 == 5 && s.d2 == 3) {
			cout << s.x1 << " " << s.y1 << " " << s.d1 << endl;
		}*/
		//cout << s.x1 << " " << s.y1 << " " << s.d1 << endl;
		//cout << s.x1 << " " << s.y1 << " " << s.d1 << " " << s.x2 << " " << s.y2 << " " << s.d2 << endl;
		while (mp[x1 + dx[d1]][y1 + dy[d1]] != '#') {
			x1 += dx[d1]; y1 += dy[d1];
		}
		int x2 = s.x2;
		int y2 = s.y2;
		int d2 = s.d2;
		//assert(mp[x1][y1] != '#');
		//assert(mp[x2][y2] != '#');
		while (mp[x2][y2] != '#') {
			//turn right
			int dd1 = (d1 + 1) % 4;
			int dd2 = (d2 + 1) % 4;
			if (mp[x2 + dx[dd2 ^ 2]][y2 + dy[dd2 ^ 2]] == '#') {
				if (!exi[x1][y1][dd1][x2][y2][dd2]) {
					exi[x1][y1][dd1][x2][y2][dd2] = true;
					q.push({ x1,y1,dd1,x2,y2,dd2 });
				}
			}
			//turn left
			dd1 = (d1 + 3) % 4;
			dd2 = (d2 + 3) % 4;
			if (mp[x2 + dx[dd2 ^ 2]][y2 + dy[dd2 ^ 2]] == '#') {
				if (!exi[x1][y1][dd1][x2][y2][dd2]) {
					exi[x1][y1][dd1][x2][y2][dd2] = true;
					q.push({ x1,y1,dd1,x2,y2,dd2 });
				}
			}

			x2 += dx[d2];
			y2 += dy[d2];
		}
	}
	int gx, gy;
	int gd = 0;
	rep(i, h)rep(j, w) {
		if (mp[i][j] == 'M') {
			gx = i, gy = j;
			rep(k, 4) {
				if (mp[i + dx[k]][j + dy[k]] != '#') {
					gd = k;
				}
			}
		}
	}
	vector<status> vf,vs;
	rep(k, 4) {
		int cx = gx, cy = gy;
		while (mp[cx][cy] != '#') {
			vf.push_back({ cx,cy,k ^ 2,0,0,0 });
			/*if (k == gd) {
				vs.push_back({ 0,0,0,cx,cy , k ^ 2 });
			}*/

			cx += dx[k];
			cy += dy[k];
		}
		cx -= dx[k]; cy -= dy[k];
		if (k == gd) {
			vs.push_back({ 0,0,0,cx,cy,k ^ 2 });
		}
	}
	for (status s2 : vs) {
		//cout << s2.x2 << " " << s2.y2 << " " << s2.d2 << endl;
	}
	for (status s1 : vf)for (status s2 : vs) {
		if (exi[s1.x1][s1.y1][s1.d1][s2.x2][s2.y2][s2.d2]) {
			cout << "He can accomplish his mission." << endl;
			return;
		}
	}
	rep(i, h)rep(j, w)rep(k, 4) {
		canr[i][j][k] = false;
	}
	rep(i, h)rep(j, w){
		if (mp[i][j] == 'K') {
			int d = 0;
			rep(k, 4) {
				int nx = i + dx[k];
				int ny = j + dy[k];
				if (mp[nx][ny] != '#')d = k;
			}
			canr[i][j][d] = true;
			q.push({ i,j,d });
		}
	}
	while (!q.empty()) {
		status s = q.front(); q.pop();
		int x = s.x1;
		int y = s.y1;
		int d = s.d1;
		while (mp[x + dx[d]][y + dy[d]] != '#') {
			x += dx[d];
			y += dy[d];
		}
		int dd = (d + 1) % 4;
		if (!canr[x][y][dd]) {
			canr[x][y][dd] = true;
			q.push({ x,y,dd });
		}
		dd = (d + 3) % 4;
		if (!canr[x][y][dd]) {
			canr[x][y][dd] = true;
			q.push({ x,y,dd });
		}
	}
	if (canr[gx][gy][gd ^ 1] || canr[gx][gy][gd ^ 3]) {
		cout << "He cannot return to the kitchen." << endl;
		return;
	}
	cout << "He cannot bring tea to his master." << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f(); //init();
	//int t; cin >> t; rep(i, t)solve();
	while(cin>>w>>h,w)solve();
	//solve();
	stop
		return 0;
}
