/* Problem URL: https://cses.fi/problemset/task/1194 */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    V<string> fds(n);
    cin >> fds;

    int si, sj;

    int inf = INT32_MAX >> 1;

    queue<pair<int, int>> mq;
    vvi mdis(n, vi(m, inf));

    rep(i, n){ 
        rep(j, m) {
            if (fds[i][j] == 'A') {
                si = i;
                sj = j;
                continue;
            }

            if (fds[i][j] == 'M') {
                mq.emplace(i, j);
                mdis[i][j] = 0;
            }
        }
    }

    auto mbfs = [&](){
        while (!mq.empty()) {
            auto [i, j] = mq.front();
            mq.pop();

            int add[][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};

            repv(k, add) {
                int id = i + k[0];
                int jd = j + k[1];

                if (id >= 0 && id < n && jd >= 0 && jd < m && fds[id][jd] != '#' && mdis[id][jd] > mdis[i][j] + 1) {
                    mdis[id][jd] = mdis[i][j] + 1;
                    mq.emplace(id, jd);
                }
            }
        }
    };

    mbfs();

    vvi pdis(n, vi(m, inf));

    auto bfs = [&](){
        pdis[si][sj] = 0;
        queue<pair<int, int>> q;
        q.emplace(si, sj);

        while (!q.empty()) {
            auto [i, j] = q.front();
            q.pop();

            
            int add[][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};

            repv(k, add) {
                int id = i + k[0];
                int jd = j + k[1];

                if (id >= 0 && id < n && jd >= 0 && jd < m && fds[id][jd] == '.' && pdis[id][jd] > pdis[i][j] + 1) {
                    pdis[id][jd] = pdis[i][j] + 1;
                    q.emplace(id, jd);
                }
            }
        }
    };

    bfs();

    string ans;

    function<bool(int, int)> dfs = [&](int i, int j) {
        if (i < 0 || i >= n || j < 0 || j >= m) {
            return true;
        }

        if (pdis[i][j] >= mdis[i][j] || fds[i][j] == '#' || fds[i][j] == 'M') {
            return false;
        }

        int add[][3] = {{0, 1, 'R'}, {0, -1, 'L'}, {-1, 0, 'U'}, {1, 0, 'D'}};

        repv(k, add) {
            int id = i + k[0];
            int jd = j + k[1];
            
            if (id >= 0 && id < n && jd >= 0 && jd < m && pdis[id][jd] <= pdis[i][j]) {
                continue;
            }

            ans.push_back(k[2]);

            if (dfs(id, jd)) {
                return true;
            }

            ans.pop_back();
        }

        return false;
    };

    if (!dfs(si, sj)) {
        cout << "NO\n";
        return 0;
    }

    ans.pop_back();

    cout << "YES\n" << ans.size() << '\n';
    cout << ans << '\n';
}