Puzzles

Limits: 2 sec., 256 MiB

Zenyk and Marichka are having a contest: who will be the first to finish their jigsaw puzzle. Zenyk’s puzzle consists of \(a\) pieces, and Marichka’s puzzle consists of \(b\) pieces.

They start at the same time, and every minute each of them puts exactly one piece of their puzzle in place. The one who places their last piece first wins. If both of them finish at the same time, the contest ends in a draw.

Determine the result of the contest.

Input

The only line contains two integers \(a\) and \(b\) – the number of pieces in Zenyk’s puzzle and in Marichka’s puzzle, respectively.

Output

In the only line, print Zenyk if Zenyk wins, Marichka if Marichka wins, or Draw if it is a draw.

Constraints

\(1 \le a, b \le 10^9\).

The scoring consists of the following blocks:

• 1 point for each example from the statement,

• 97 points: no additional constraints.

You get the points for a block only if your program passes all tests of the block.

Samples

Input (stdin) сopy	Output (stdout) сopy
300 500	Zenyk

Input (stdin) сopy	Output (stdout) сopy
1000 24	Marichka

Input (stdin) сopy	Output (stdout) сopy
47 47	Draw

Notes

In the first example, Zenyk finishes the puzzle in 300 minutes, and at that moment Marichka still has 200 pieces left to place.

In the third example, both finish their puzzles in 47 minutes, so it is a draw.