#include <bits/stdc++.h>

using namespace std;

auto start = chrono::steady_clock::now();

auto elapsed() { return (chrono::steady_clock::now() - start).count(); }

constexpr int grid_size = 60;  // 迷宮の大きさ
constexpr int max_hp = 1500;   // 初期体力
constexpr int dy[4] = {-1, 1, 0, 0};
constexpr int dx[4] = {0, 0, -1, 1};
constexpr auto dir = "UDLR";

// 探知機の情報
struct enemy {
    int y, x, d, num;
    bool destroyed;
    enemy(int y, int x, int d, int num) {
        this->y = y, this->x = x, this->d = d;
        this->num = num;
        destroyed = false;
    }
};

// 範囲外かどうか
bool range_out(size_t y, size_t x) { return x >= grid_size or y >= grid_size; }

// BFSによる経路探索
string find_path(int sy, int sx, int gy, int gx, const vector<string> &S) {
    int siz = S.size();
    vector<vector<int>> dist(siz, vector<int>(siz, -1));
    vector<vector<int>> seen(siz, vector<int>(siz));
    dist[sy][sx] = 0;
    deque<pair<int, int>> q;
    q.emplace_back(sy, sx);
    while (!q.empty()) {
        pair<int, int> p = q.front();
        q.pop_front();
        int y = p.first, x = p.second;
        if (seen[y][x]) continue;
        seen[y][x] = true;
        for (int k = 0; k < 4; k++) {
            int ny = y + dy[k], nx = x + dx[k];
            if (range_out(ny, nx)) continue;
            if (dist[ny][nx] != -1) continue;
            if (seen[ny][nx]) continue;
            char cell = S[ny][nx];
            if (cell == '#' || cell == 'B' || cell == 'E') continue;
            if (cell == 'J') {
                dist[ny][nx] = dist[y][x] - 1000;
                q.emplace_front(ny, nx);
            } else {
                dist[ny][nx] = dist[y][x] + 1;
                q.emplace_back(ny, nx);
            }
        }
    }
    string res;
    if (dist[gy][gx] == -1) return res;
    int now_y = gy, now_x = gx, now_d = dist[gy][gx];
    seen = vector<vector<int>>(siz, vector<int>(siz));
    while (now_y != sy || now_x != sx) {
        bool moved = false;
        for (int k = 0; k < 4; k++) {
            int new_y = now_y + dy[k], new_x = now_x + dx[k];
            if (range_out(new_y, new_x)) continue;
            bool good = false;
            if (dist[new_y][new_x] == now_d - 1 and S[now_y][now_x] != 'J') {
                good = true;
            }
            if (dist[new_y][new_x] == now_d + 1000 and S[now_y][now_x] == 'J') {
                good = true;
            }
            if (not good) continue;
            if (seen[new_y][new_x]) continue;
            seen[new_y][new_x] = true;
            now_y = new_y, now_x = new_x;
            now_d = dist[new_y][new_x];
            res.push_back(dir[k ^ 1]);
            moved = true;
            break;
        }
        assert(moved);
    }
    reverse(res.begin(), res.end());
    return res;
}

int main() {
    // 入力の受け取り
    int N, D, H;
    cin >> N >> D >> H;
    vector<string> S(N);
    for (int i = 0; i < N; i++) cin >> S[i];
    int M;
    cin >> M;
    vector<enemy> E;
    for (int i = 0; i < M; i++) {
        int y, x, d;
        cin >> y >> x >> d;
        E.emplace_back(y, x, d, i);
    }

    string ans;
    int sy = -1, sx = -1, ky = -1, kx = -1, gy = -1, gx = -1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (S[i][j] == 'S') {
                sy = i, sx = j;
            } else if (S[i][j] == 'K') {
                ky = i, kx = j;
            } else if (S[i][j] == 'G') {
                gy = i, gx = j;
            }
        }
    }

    // 鍵の取得
    string find_key = find_path(sy, sx, ky, kx, S);
    ans += find_key;
    // 扉への移動
    string goal = find_path(ky, kx, gy, gx, S);
    ans += goal;
    for (auto c : ans) {
        cout << "M " << c << endl;
    }

    return 0;
}