"iShongololo" is the Zulu name for a millipede. They are long, shiny, black arthropods with many legs.
The iShongololo eats through an edible "fruit" which for the sake of this problem can be considered a rectangular solid with integer dimensions of L (length), W (width) and H (height).
Task:
You are required to write a program that maximizes the number of blocks eaten by the iShongololo without violating the constraints given. The program must output the actions that the iShongololo makes as it eats its way through the fruit.
The iShongololo starts outside the fruit. The first block the iShongololo must eat is 1, 1, 1 and it must then move to this block. It stops when no more blocks can be legally eaten and it can no longer move.
Constraints:
Input:
As input your program will receive three numbers (integers) which are the length (L), width (W) and height (H) of the solid.
The three integers L, W, H, are each on a separate line. The three integers will be between 1 and 32 (inclusive).
Sample input:
TOXIC.DAT 
Explanation: 
2 3 2 
Length of solid is 2. Width of solid is 3. Height of solid is 2. 
Output:
The output consists of lines that begin with "E" (eat) or "M" (move) followed by 3 integers that represent the block eaten or moved to on the axes corresponding to L, W, H.
For example the following is a valid solution for the input example.
Sample output (this may not be optimal):
TOXIC.OUT 
Explanation: 
E 1 1 1

Eat the block 1 1 1

Scoring: