D. Whose Turn Is It?
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Joãozão and Marcel are excited to practice weightlifting at the UDESC gym. The two of them take turns doing sets, where each set consists of exactly $$$M$$$ repetitions of the exercise. Marcel always starts. However, they have a peculiar way of counting the repetitions when they alternate: they count the total $$$N$$$ repetitions that both did, without counting individually how much each one did. Now, after spending a lot of time not knowing whose turn it is to exercise, they asked for your help.

Write a program that, given the total number of repetitions done so far and the number of exercises per set, says who is next to perform the exercise.

Input

The input consists of two lines. The first line contains the integer $$$N$$$ $$$(0 \leq N \leq 10^{9})$$$ representing the repetitions done so far, and the second line contains the integer $$$M$$$ $$$(1 \leq M \leq 10^{9})$$$ representing the repetitions in each set.

Output

Print "MARCEL" or "JOAOZAO", the name of the person whose turn it is to do the exercise.

Examples
Input
10
3
Output
JOAOZAO
Input
6
8
Output
MARCEL
Input
20
1
Output
MARCEL
Note

In the first example, each person does 3 repetitions, so the sequence of 10 repetitions is:

  • Marcel did 3 (total 3).
  • Joãozão did another 3 (total 6).
  • Marcel did another 3 (total 9).
  • Joãozão did 1 more (total 10).

Therefore, Joãozão is next to do the exercise, since he has not yet completed his current set of 3 exercises.

In the second example, Marcel did 6 out of his 8 repetitions, so he is still the next one to do the exercise.