B. Bit Tennis
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

After participating in the MFP (Matchup of Finalists in Ping-pong) in Campinas, Giovana and Julia are tired of playing ping-pong and decide they need to devise a new sport. They want a sport that, besides physical performance, requires mathematical reasoning and strategy. As both are very fond of binary numbers, they thought of the following game, which they named "Bit Tennis", to play against each other:

  • The game starts with a string $$$S$$$, of size $$$N$$$, that represents a number in binary;
  • Giovana begins the game and thereafter they alternate turns between Julia and her;
  • In each round, the current player can add one more digit ("0" or "1") to the end or the beginning of the string: for example, if the string is "110", the player can turn it into "1100", "1101", "0110" or "1110".
  • If, after $$$K$$$ turns from each player, the number is a multiple of 3, Julia wins. Otherwise, Giovana wins.

Both quickly learned to play optimally and, after playing a few times, they noticed that the game's outcome is always determined before the first move is even made. Curious about this fact, they asked for your help to, given the initial string and number of turns, find out which one of them will win.

Input

The first line of the input consists of the integer $$$N$$$ $$$(1 \leq N \leq 10^5)$$$, the size of the string $$$S$$$, and the integer $$$K$$$ $$$(1 \leq K \leq 10^5)$$$, the number of moves each one will make.

The second line contains the string $$$S$$$, which represents the binary number the game starts with, from the most significant bit to the least significant.

Output

Print "GIOVANA" or "JULIA", the name of the winner of the game if both play optimally.

Examples
Input
4 1
0111
Output
GIOVANA
Input
10 50
1011111101
Output
JULIA