Uolevi and Maija are playing a game with two piles of stones. The players take turns, and in one turn a player can do one of two actions:

1. Take one or more stones from one pile and put them on the other,
2. Take one or more stones from one pile and discard them.

The first player who can't make a move loses. Determine the winner if both players play optimally and Uolevi goes first, or report that the game will continue indefinitely; i.e. that it is a draw.

Input

The first line of input consists of two space-separated numbers, a and b: the number of stones in the piles.

Output

Output "Uolevi", "Maija" or "Draw", showing the result of the game. Note that the output is case-sensitive.

Constraints

• 1 \leq a, b \leq 300

Example 1

Input:

 1 2 

Output:

 Uolevi 

Example 2

Input:

 1 1 

Output:

 Maija 

Example 3

Input:

 239 123 

Output:

 Uolevi