Robot Navigation

Description

A robot has been sent to explore a remote planet. To specify a path the robot should take, a program is sent each day. The program consists of a sequence of the following commands:

• FORWARD X: move forward by X units.
• TURN LEFT: turn left (in place) by 90 degrees.
• TURN RIGHT: turn right (in place) by 90 degrees.

The robot also has sensor units which allow it to obtain a map of its surrounding area. The map is represented as a grid. Some grid points contain hazards (e.g. craters) and the program must avoid these points or risk losing the robot.

Naturally, if the initial location of the robot, the direction it is facing, and its destination position are known, it is best to send the shortest program (one consisting of the fewest commands) to move the robot to its destination (we do not care which direction it faces at the destination). You are more interested in knowing the number of different shortest programs that can move the robot to its destination. However, the number of shortest programs can be very large, so you are satisfied to compute the number as a remainder modulo 1,000,000.

Input

There will be several test cases in the input. Each test case will begin with a line with two integers

N M

Where N is the number of rows in the grid, andM is the number of columns in the grid ( 2N,M100). The nextN lines of input will have M characters each. The characters will be one of the following:

• `.' Indicating a navigable grid point.
• `*' Indicating a crater (i.e. a non-navigable grid point).
• `X' Indicating the target grid point. There will be exactly one `X'.
• `N', `E', `S', or `W' Indicating the starting point and