#include <bits/stdc++.h>
// created [2020/03/09] 22:05:43
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T>
using max_heap = std::priority_queue<T>;
template<typename T>
using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

int out() { return 0; }
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    while (true) {
        auto W = in<int>(), H = in<int>();
        if (W == 0 and H == 0) { break; }
        const auto sss = in_v<std::string>({H});
        const int S    = H * W;
        auto enc       = [&](const int y, const int x) { return y * W + x; };
        const int SS   = S * S;
        auto encenc    = [&](const int a_tern, const int qy, const int qx, const int ay, const int ax) { return a_tern * SS + enc(qy, qx) * S + enc(ay, ax); };
        std::vector<std::vector<int>> g(2 * SS);
        std::vector<int> odim(2 * SS, 0);
        constexpr int dys[] = {-1, 0, 0, 1, 0};
        constexpr int dxs[] = {0, -1, 1, 0, 0};
        for (int a_tern = 0; a_tern < 2; a_tern++) {
            if (a_tern == 0) {
                for (int qy = 0; qy < H; qy++) {
                    for (int qx = 0; qx < W; qx++) {
                        if (sss[qy][qx] == '#') { continue; }
                        for (int ay = 0; ay < H; ay++) {
                            for (int ax = 0; ax < W; ax++) {
                                if (sss[ay][ax] == '#') { continue; }
                                if (qy == ay and qx == ax) { continue; }
                                const int ss = encenc(a_tern, qy, qx, ay, ax);
                                for (int qd = 0; qd < 5; qd++) {
                                    const int dqy = dys[qd], dqx = dxs[qd];
                                    const int nqy = qy + dqy, nqx = qx + dqx;
                                    if (nqy < 0 or nqy >= H or nqx < 0 or nqx >= W) { continue; }
                                    if (sss[nqy][nqx] == '#') { continue; }
                                    const int nss = encenc(1 - a_tern, nqy, nqx, ay, ax);
                                    g[nss].push_back(ss);
                                    odim[ss]++;
                                }
                            }
                        }
                    }
                }
            } else {
                for (int qy = 0; qy < H; qy++) {
                    for (int qx = 0; qx < W; qx++) {
                        if (sss[qy][qx] == '#') { continue; }
                        for (int ay = 0; ay < H; ay++) {
                            for (int ax = 0; ax < W; ax++) {
                                if (sss[ay][ax] == '#') { continue; }
                                const int ss = encenc(a_tern, qy, qx, ay, ax);
                                for (int ad = 0; ad < 5; ad++) {
                                    const int day = dys[ad], dax = dxs[ad];
                                    const int nay = ay + day, nax = ax + dax;
                                    if (nay < 0 or nay >= H or nax < 0 or nax >= W) { continue; }
                                    if (sss[nay][nax] == '#') { continue; }
                                    const int nss = encenc(1 - a_tern, qy, qx, nay, nax);
                                    g[nss].push_back(ss);
                                    odim[ss]++;
                                }
                            }
                        }
                    }
                }
            }
        }
        std::vector<int> win(SS * 2, 2);  // 0:lose, 1:win, 2:draw
        std::queue<int> Q;
        for (int a_tern = 0; a_tern < 2; a_tern++) {
            for (int qy = 0; qy < H; qy++) {
                for (int qx = 0; qx < W; qx++) {
                    if (sss[qy][qx] == '#') { continue; }
                    for (int ay = 0; ay < H; ay++) {
                        for (int ax = 0; ax < W; ax++) {
                            if (sss[ay][ax] == '#') { continue; }
                            const int ss = encenc(a_tern, qy, qx, ay, ax);
                            if (a_tern == 0) {
                                if (qy == ay and qx == ax) {
                                    win[ss] = 0;
                                    Q.push(ss);
                                } else if (sss[qy][qx] == 'E') {
                                    win[ss] = 1;
                                    Q.push(ss);
                                }
                            } else {
                                if (qy == ay and qx == ax) {
                                    win[ss] = 1;
                                    Q.push(ss);
                                }
                            }
                        }
                    }
                }
            }
        }
        while (not Q.empty()) {
            const int ss = Q.front();
            Q.pop();
            for (const int nss : g[ss]) {
                if (win[nss] != 2) { continue; }
                odim[nss]--;
                if (win[ss] == 0) {
                    win[nss] = 1;
                    Q.push(nss);
                } else if (win[ss] == 1) {
                    if (odim[nss] == 0) {
                        win[nss] = 0;
                        Q.push(nss);
                    }
                }
            }
        }
        int qy = -1, qx = -1, ay = -1, ax = -1;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (sss[i][j] == 'Q') { qy = i, qx = j; }
                if (sss[i][j] == 'A') { ay = i, ax = j; }
            }
        }
        const int init_ss = encenc(false, qy, qx, ay, ax);
        const int ans     = win[init_ss];
        if (ans == 0) {
            outln("Army can catch Queen.");
        } else if (ans == 1) {
            outln("Queen can escape.");
        } else {
            outln("Queen can not escape and Army can not catch Queen.");
        }
    }
    return 0;
}



Measured memory_bytes: 30408