import java.util.*;

public class Main {
    static class Point {
        int x, y;

        Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

    static class State {
        Point p;
        int wallsBroken;

        State(Point p, int wallsBroken) {
            this.p = p;
            this.wallsBroken = wallsBroken;
        }
    }

    static boolean isValid(int x, int y, int rows, int cols) {
        return x >= 0 && x < rows && y >= 0 && y < cols;
    }

    static int bfs(char[][] grid, Point start, Point finish) {
        int rows = grid.length;
        int cols = grid[0].length;
        int[][] dist = new int[rows][cols];
        for (int[] row : dist)
            Arrays.fill(row, -1);
        Queue<Point> q = new LinkedList<>();
        q.add(start);
        dist[start.x][start.y] = 0;

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

        while (!q.isEmpty()) {
            Point p = q.poll();
            if (p.x == finish.x && p.y == finish.y) {
                return dist[p.x][p.y];
            }
            for (int i = 0; i < 4; ++i) {
                int nx = p.x + dx[i];
                int ny = p.y + dy[i];
                if (isValid(nx, ny, rows, cols) && dist[nx][ny] == -1 && grid[nx][ny] != 'W') {
                    dist[nx][ny] = dist[p.x][p.y] + 1;
                    q.add(new Point(nx, ny));
                }
            }
        }
        return -1; // Path not found
    }

    static int bfsMouse(char[][] grid, Point start, Point finish, int humanSteps) {
        int rows = grid.length;
        int cols = grid[0].length;
        int[][][] dist = new int[rows][cols][2];
        for (int[][] mat : dist)
            for (int[] row : mat)
                Arrays.fill(row, -1);
        Queue<State> q = new LinkedList<>();
        q.add(new State(start, 0));
        dist[start.x][start.y][0] = 0;

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

        while (!q.isEmpty()) {
            State s = q.poll();
            Point p = s.p;
            int wallsBroken = s.wallsBroken;

            if (p.x == finish.x && p.y == finish.y) {
                return dist[p.x][p.y][wallsBroken];
            }

            if (dist[p.x][p.y][wallsBroken] >= humanSteps)
                continue;

            for (int i = 0; i < 4; ++i) {
                int nx = p.x + dx[i];
                int ny = p.y + dy[i];
                if (!isValid(nx, ny, rows, cols))
                    continue;
                char cell = grid[nx][ny];
                if (cell != 'W') {
                    if (dist[nx][ny][wallsBroken] == -1) {
                        dist[nx][ny][wallsBroken] = dist[p.x][p.y][wallsBroken] + 1;
                        q.add(new State(new Point(nx, ny), wallsBroken));
                    }
                } else if (wallsBroken == 0) {
                    if (dist[nx][ny][1] == -1) {
                        dist[nx][ny][1] = dist[p.x][p.y][wallsBroken] + 1;
                        q.add(new State(new Point(nx, ny), 1));
                    }
                }
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M = sc.nextInt();
        int N = sc.nextInt();
        char[][] field = new char[M][N];
        Point humanStart = null, mouseStart = null, finish = null;

        for (int i = 0; i < M; ++i) {
            String line = sc.next();
            for (int j = 0; j < N; ++j) {
                field[i][j] = line.charAt(j);
                if (field[i][j] == 'H')
                    humanStart = new Point(i, j);
                else if (field[i][j] == 'M')
                    mouseStart = new Point(i, j);
                else if (field[i][j] == 'F')
                    finish = new Point(i, j);
            }
        }

        int humanSteps = bfs(field, humanStart, finish);

        if (humanSteps == -1) {
            System.out.print("MOUSE");
            return;
        }

        humanSteps = (int) Math.ceil(humanSteps / 2.0);

        int mouseSteps = bfsMouse(field, mouseStart, finish, humanSteps);

        if (mouseSteps == -1 || humanSteps < mouseSteps) {
            System.out.print("HUMAN");
        } else if (humanSteps > mouseSteps) {
            System.out.print("MOUSE");
        } else {
            System.out.print("DRAW");
        }
    }
}