Have you ever play chess with other?

Now Alice and Bob are playing game with each other. They both have a castle on the checkerboard, the size of checkerboard is n*m, and Alice’s castle is at point (x1,y1), Bob’s castle is at (x2,y2).

The rule of the game is:

1.    Alice’s turn first ,and then Bob’s, then Alice’s, and so on.

2.    At one’s turn, one can move his (her) castle Horizontally or vertically, but can not cross or arrive the location which other’s castle can arrive. For example, if Bob’s castle is at (3,5), then Alice’s castle can not cross or arrive any point(3,y) or (x,5).

3.    Of course the castle can not move away from the checkerboard.

4.    The one who can not move his (her) castle lose the game.

Your task is to find out who will win the game if they both play the game wisely.

 There is a T at the beginning of file, show that there is T case follow.

  For every case, there is one line contain 6 integer n,m,x1,y1,x2,y2.

  You can assure x1 != x2 && y1 != y2.

 （10<=n,m<=1000, 1<=x1,x2,<=n,1<=y1,y2<=m）

  For every case, first output "Case #x: " , x mean the number of case.

 If Alice will win, output  “A”, else output ”B”.

 See sample for detail.