CF1921E.Eat the Chip

Alice and Bob are playing a game on a checkered board. The board has $h$ rows, numbered from top to bottom, and $w$ columns, numbered from left to right. Both players have a chip each. Initially, Alice's chip is located at the cell with coordinates $(x_a, y_a)$ (row $x_a$, column $y_a$), and Bob's chip is located at $(x_b, y_b)$. It is guaranteed that the initial positions of the chips do not coincide. Players take turns making moves, with Alice starting.

On her turn, Alice can move her chip one cell down or one cell down-right or down-left (diagonally). Bob, on the other hand, moves his chip one cell up, up-right, or up-left. It is not allowed to make moves that go beyond the board boundaries.

More formally, if at the beginning of Alice's turn she is in the cell with coordinates $(x_a, y_a)$, then she can move her chip to one of the cells $(x_a + 1, y_a)$, $(x_a + 1, y_a - 1)$, or $(x_a + 1, y_a + 1)$. Bob, on his turn, from the cell $(x_b, y_b)$ can move to $(x_b - 1, y_b)$, $(x_b - 1, y_b - 1)$, or $(x_b - 1, y_b + 1)$. The new chip coordinates $(x', y')$ must satisfy the conditions $1 \le x' \le h$ and $1 \le y' \le w$.

Example game state. Alice plays with the white chip, Bob with the black one. Arrows indicate possible moves.

A player immediately wins if they place their chip in a cell occupied by the other player's chip. If either player cannot make a move (Alice—if she is in the last row, i.e. $x_a = h$, Bob—if he is in the first row, i.e. $x_b = 1$), the game immediately ends in a draw.

What will be the outcome of the game if both opponents play optimally?

爱丽丝和鲍勃正在一个方格棋盘上进行一场游戏。棋盘有 $h$ 行（从上到下编号）和 $w$ 列（从左到右编号）。双方各持有一枚棋子。初始时，爱丽丝的棋子位于坐标为 $(x_a, y_a)$ 的格子（第 $x_a$ 行、第 $y_a$ 列），鲍勃的棋子位于 $(x_b, y_b)$。保证两枚棋子的初始位置不重合。双方轮流行动，爱丽丝先行。

在爱丽丝的回合中，她可将她的棋子向下移动一格，或向右下对角线移动一格，或向左下对角线移动一格。而鲍勃则可在他的回合中将他的棋子向上移动一格，或向右上对角线移动一格，或向左上对角线移动一格。不允许走出棋盘边界。

更形式化地：若爱丽丝在她回合开始时位于坐标为 $(x_a, y_a)$ 的格子，则她可将棋子移至以下三格之一：$(x_a + 1, y_a)$、$(x_a + 1, y_a - 1)$ 或 $(x_a + 1, y_a + 1)$；而鲍勃在他回合开始时若位于 $(x_b, y_b)$，则可将棋子移至 $(x_b - 1, y_b)$、$(x_b - 1, y_b - 1)$ 或 $(x_b - 1, y_b + 1)$。新坐标 $(x', y')$ 必须满足 $1 \le x' \le h$ 且 $1 \le y' \le w$。

游戏状态示例。爱丽丝使用白色棋子，鲍勃使用黑色棋子。箭头表示可能的走法。

若某位玩家将其棋子移动至对方棋子所在的格子，则该玩家立即获胜。若任一玩家无法移动（爱丽丝无法移动当且仅当她位于最后一行，即 $x_a = h$；鲍勃无法移动当且仅当他位于第一行，即 $x_b = 1$），则游戏立即以平局结束。

若双方均采取最优策略，游戏结果将如何？

Each test consists of multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases. This is followed by the description of the test cases.

Each test case consists of a single line containing six integers $h$, $w$, $x_a$, $y_a$, $x_b$, $y_b$ ($1 \le x_a, x_b \le h \le 10^6$, $1 \le y_a, y_b \le w \le 10^9$) — the dimensions of the board and the initial positions of Alice's and Bob's chips. It is guaranteed that either $x_a \ne x_b$ or $y_a \ne y_b$.

It is guaranteed that the sum of $h$ over all test cases does not exceed $10^6$.

每个测试包含多个测试用例。第一行包含一个整数 $t$（$1 \le t \le 10^4$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例由一行组成，包含六个整数 $h$、$w$、$x_a$、$y_a$、$x_b$、$y_b$（$1 \le x_a, x_b \le h \le 10^6$，$1 \le y_a, y_b \le w \le 10^9$），分别表示棋盘的尺寸以及爱丽丝和鲍勃的棋子的初始位置。保证满足 $x_a \ne x_b$ 或 $y_a \ne y_b$ 中至少一个成立。

保证所有测试用例中 $h$ 的总和不超过 $10^6$。

For each test case, output "Alice" if Alice wins, "Bob" if Bob wins, and "Draw" if neither player can secure a victory. You can output each letter in any case (lowercase or uppercase). For example, the strings "bOb", "bob", "Bob", and "BOB" will be accepted as Bob's victory.

对于每个测试用例，若 Alice 获胜，则输出 “Alice”；若 Bob 获胜，则输出 “Bob”；若双方均无法确保获胜，则输出 “Draw”。字母大小写不限（即小写或大写均可）。例如，字符串 “bOb”、“bob”、“Bob” 和 “BOB” 均被视为 Bob 获胜的有效输出。