QOJ.ac

QOJ

時間限制: 1.0 s 記憶體限制: 1024 MB 總分: 100 可 Hack ✓

#14512. Badminton Match

统计

Alice and Bob are playing badminton. The winning conditions for each game of badminton are as follows: If a player reaches at least 21 points and leads the opponent by at least 2 points, they win. If a player reaches 30 points, they win.

Given the current score $a : b$, where Alice's score is $a$ and Bob's score is $b$, you, as the referee, need to determine if anyone has already won.

Input

The input consists of a single line containing two non-negative integers $a, b$ ($0 \le a, b \le 30$), representing the scores of Alice and Bob, respectively. It is guaranteed that the given score is one that could occur during a game.

Output

If Alice has won, output Alice. If Bob has won, output Bob. If no one has won yet, output Underway.

Examples

Input 1

21 15

Output 1

Alice

Input 2

29 30

Output 2

Bob

Input 3

22 21

Output 3

Underway

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.