#abc071a. [abc071_a]Meal Delivery
[abc071_a]Meal Delivery
Problem Statement
Snuke lives at position on a number line. On this line, there are two stores and , respectively at position and , that offer food for delivery.
Snuke decided to get food delivery from the closer of stores and . Find out which store is closer to Snuke's residence.
Here, the distance between two points and on a number line is represented by .
Constraints
- and are pairwise distinct.
- The distances between Snuke's residence and stores and are different.
Input
Input is given from Standard Input in the following format:
Output
If store is closer, print A
; if store is closer, print B
.
Sample Input 1
5 2 7
Sample Output 1
B
The distances between Snuke's residence and stores and are and , respectively. Since store is closer, print B
.
Sample Input 2
1 999 1000
Sample Output 2
A