Bablu and Jha.2 are going on another quest to save Princess X hoping that she will fall for them. After many hurdles they finally arrive at her castle to free her from her captor. A long battle ensues with none of the two sides winning. Unsurprisingly, the princess, tired of waiting all this time for someone to come free her, defeats her captor and shows her disappointment with the aptitude of so-called princes running around.

Jha.2 and Bablu try their age old trick of showing puppy eyes, and it works! The Princess X agrees to going on a date with one of them. But the Princess, unable to decide who to go on a date with, asks them to contest each other in a game she had designed a long while back.

She shows them a 2D maze of N rows and M columns consisting of many orbs floating at a non-negative height from the ground. She gives them a rectangular part of the maze indicated by $(X1,Y1)$ and $(X2,Y2)$, $(X1,Y1)$ being the top-left corner of the part and $(X2,Y2)$ being the bottom-right corner, and asks them to bring each orb to height of unit 1 or unit 0.

Each step consists of taking any one orb having height h and reducing it's height by any of h's prime factors multiplied by any number in the range $1 \le Exp$ where $Exp$ is the exponent of the prime factor, e.g.

For 144, you can subtract $2*1 = 2$ or $2*2 = 4$ or $2*3 = 6$ or $2*4=8$ or $3*1=3$ or $3*2=6$.

Jha.2 being the one with an interesting name, takes the first step. The one who gets the part of the maze with all orbs at 0 or 1 loses the contest.

As the princess is deciding which part of the maze to select, Jha.2 and Bablu quickly call Anmol to ask him how to play the game best and who will win the game for a specific part of the maze because they believe that he is good with girls and a pro at playing games (neither of them is true, by the way -_- ). Anmol tells them the best way to play the game, but being his lazy self and playing another match of DoTA, he asks you to tell them the winner of the game.

Input

The first line of input consists of two integers, N and M.

N lines follow, the ith line consisting of M integers. The jth integer of ith line representing the height of the orb at the $(i,j)$th cell in the maze.

After this, a line consisting of a single integer Q is given, representing the no. of queries.

Q lines follow, the ith line consisting of four integers $X1$, $Y1$, $X2$, and $Y2$, as described above.

Output

For each Query, output in a new line, who will win. If Jha.2 wins, output "Jha.2" (without quotes), and if Bablu wins, output "Bablu" (without quotes).

Constraints

$1 \le N \le 10^3$

$1 \le M \le 10^3$

$1 \le h \le 10^6$

$1 \le Q \le 10^6$

$1 \le X1, X2 \le M$

$1 \le Y1, Y2 \le N$

The top-left corner of the maze is at $(1,1)$

In $(X,Y)$, X represents column number and Y represents row number.