What could be Ana and Bob doing while the world is being destroyed? Playing, of course! It’s a simple game, in a rectangular board with N rows and M columns (N ∗ M cells). Ana starts playing: she can pick any position in the board where there’s a square of 2×2 unmarked cells and mark them. Then, it’s Bob’s turn: he can pick any unmarked cell and mark it. If a player has no move, he passes his turn, until there’s no unmarked cells. Who marks the largest number of cells wins the game. Ana and Bob are optimal players, and they always play to win (or draw if they cannot win). Possible sequence of a game between Ana and Bob, where Ana marks red and Bob marks blue. Note that, by the end of this sequence of turns, ana won’t be able to mark further cells and will always pass her turn to Bob. Input The first line contains T (T ≤ 104) — the number of test cases, after this line T test cases follows. Each test case is arranged in a line containing two integers N and M (1 ≤ N, M ≤ 100) — the number of rows and the number of columns of the board, correspondingly. Output For each test case print a line containing ‘Case #X: Y ’, where X is the case number, starting at 1, and Y is ‘Ana’ (without the quotes) if she can win independently of how good Bob is; ‘Bob’ (without the quotes) if he can win independently of how good Ana is; or ‘Draw’ (without the quotes), otherwise. Sample Input 3 23 24 33 Sample Output Case #1: Ana Case #2: Draw Case #3: Bob