Problem Description

Ant and Bug are playing a game with sliding stones. The game uses a straight, narrow ice board and two small stones. The ice board is marked with scales from -1000 to 1000 at every millimeter.

Initially, each player has one stone. The players take turns sliding their stones from one end of the board. The player whose stone ends up closer to the 0 mark wins the game. If both stones are equidistant from the 0 mark, the game is a draw.

Please write a program to determine the winner when the positions of the two stones are given.

Input Format

The input is given from the standard input in the following format:

$ A $ $ B $

• The first line contains two integers, $A\ (-1,000\ ≦\ A\ ≦\ 1,000)$ representing the position of Ant's stone and $B\ (-1,000\ ≦\ B\ ≦\ 1,000)$ representing the position of Bug's stone, separated by a space.

Output Format

Output Ant if Ant wins, Bug if Bug wins, or Draw if the game is a draw. End the output with a newline.

Sample Input and Output

Sample Input #1

2 3

Sample Output #1

Ant

Sample Input #2

1 0

Sample Output #2

Bug

Sample Input #3

-100 100

Sample Output #3

Draw

Notes/Hints

Partial Points

This problem has partial scoring.

• If you correctly solve all test cases where $0\ ≦\ A$ and $0\ ≦\ B$, you will be awarded 50 points.

Sample Explanation 1

Ant's stone is at the 2 mark, and Bug's stone is at the 3 mark. Since Ant's stone is closer to the 0 mark, Ant wins.

Sample Explanation 3

Although the positions of the two stones are different, they are equidistant from the 0 mark, resulting in a draw.

见题面 Input 部分

见题面 Output 部分