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

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = list(map(int, input().split()))
print("A" if abs(x-a) < abs(x-b) else "B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
  print("B")
else:
  print("A")

Solution (Python):
x,a,b = map(int,input().split())
if abs(a-x) < abs(b-x):
  print('A')
else:
  print('B')

Solution (Python):
X, a, b = [int(x) for x in input().split()]
da = abs(X-a)
db = abs(X-b)

if abs(X-a) < abs(X-b):
  print("A")
else:
  print("B")

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 




 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    x,a,b = inputMap()
    
    if abs(x-a) < abs(x-b):
        print("A")
    else:
        print("B")
    
    
if __name__ == "__main__":
	main()

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
  print('B')
else:
  print('A')

Solution (Python):
x,y,z = map(int,input().split())
if abs(x-y) > abs(x-z):
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = list(map(int, input().split()))
def MealDelivery(x, a, b):
    if abs(x -a) < abs(x -b):
        return 'A'
    elif abs(x -a) > abs(x -b):
        return 'B'
    else:
        return 'Even'
ans = MealDelivery(x, a, b)
print(ans)

Solution (Python):
x, a, b = map(int, input().split())

if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Solution (Python):
x, a, b = map(int, input().split())
if abs(a -x) < abs(b - x):
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = map(int, input().split())
print("A") if abs(x-a) < abs(x-b) else print("B")

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
  print('A')
else:
  print('B')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
  print('A')
else:
  print('B')

Solution (Python):
x,a,b = map(int,input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa > xb:
    print('B')
else:
    print('A')

Solution (Python):




x,a,b = list(map(int,input().split(" ")))


distA = abs(x - a)
distB = abs(x - b)

if distA >= distB:
  print("B")
else:
  print("A")

Solution (Python):
x, a, b = map(int, input().split())
ax = int((((a-x)**2)**0.5)//1)
bx = int((((b-x)**2)**0.5)//1)
print('A') if ax < bx else print('B')

Solution (Python):

x,a,b = [int(i) for i in input().split()]

A = abs(x - a)
B = abs(x - b)
if A < B:
    print("A")
if A > B:
    print("B")

Solution (Python):
x, a, b = map(int,input().split())

if abs(x - a) > abs(x - b):
    print("B")
else:
    print("A")

Solution (Python):
x, a, b = map(int, input().split())
A = abs(x - a)
B = abs(x - b)
if A > B:
  print("B")
else:
  print("A")

Solution (Python):
x,a,b = map(int, input().split())
if abs(x-a) < abs(x-b):
  print ('A')
else:
  print ('B')

Solution (Python):
x,a,b = list(map(int,input().split()))

if abs(a-x)<=abs(b-x):
  print("A")
else:
  print("B")

Solution (Python):
def ab(x):
  if x > 0 :
    return x
  else:
    return -x


x, a, b = map(int,input().split())
if ab(x-a) >ab(x-b):
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
  print ('A')
else:
  print ('B')

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(a - x) < abs(b - x) else 'B')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b) : print('A')
else : print('B')

Solution (Python):
x, a, b = map(int, input().split())
a = abs(x - a)
b = abs(x - b)
ans = 'A'
if a > b:
  ans = 'B'
print(ans)

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) > abs(x-b):
  print("B")
else:
  print("A")

Solution (Python):
x,a,b = map(int, input().split())
if abs(x-a)>abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

m, b, c = MAP()

if abs(m - b) < abs(m - c):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b = map(int,input().split())

if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b = map(int,input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):
x,a,b = map(int,input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):
x, a, b = map(int, input().split())

tmpa = abs(a - x)
tmpb = abs(b - x)
if tmpa < tmpb:
    print('A')
else:
    print('B')

Solution (Python):
a, b, c = map(int, input().split())
if abs(a-b) < abs(a-c):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
print('AB'[abs(x-a)>abs(x-b)])

Solution (Python):
x, a, b = map(int, input().split())

aa = abs(x-a)
bb = abs(x-b)

if aa < bb:
  print('A')
else:
  print('B')

Solution (Python):
x, a, b = map(int, input().split())

if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int, input().split())
if abs(x-a)<abs(x-b):
  print('A')
else:
  print('B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):

x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Solution (Python):
a, b, c = map(int, input().split())
if abs(a - b) < abs(a - c):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
      print("A")
else:
      print("B")

Solution (Python):



x, a, b = map(int, input().split())


ans = 'A' if abs(x - a) < abs(x - b) else 'B'


print(ans)

Solution (Python):

x,a,b = map(int,input().split())

if abs(a-x) > abs(b-x):

    print("B")

else:

    print ("A")

Solution (Python):
x,a,b=map(int,input().split())
if abs(a-x) < abs(b-x):print("A")
else:print("B")

Solution (Python):


x,a,b = list(map(int,input().split()))
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(a-x) < abs(b-x):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>=abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
x,a,b=map(int,input().split())
print('A' if abs(a-x)<abs(b-x) else 'B')

Solution (Python):
x, a, b = map(int, input().split())

if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int, input().split())

d_a = abs(x-a)
d_b = abs(x-b)

if d_a < d_b:
  print('A')
else:
  print('B')

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
  print("A")
else:
  print("B")

Solution (Python):
a = list(map(int,input().split()))
b = abs(a[0]-a[1])
c = abs(a[0]-a[2])

if b <= c:
  print("A")
else:
  print("B")

Solution (Python):
x,a,b = map(int,input().split())
x_a = a-x
x_b = b-x
if x_a < 0:
  x_a = -x_a
if x_b < 0:
  x_b = -x_b
print('A' if x_a <= x_b else 'B')

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):
def print_ans(x,a,b):
    """Print min(abs(x-a),abs(x-b))

    Parameters
    --------------

    Examples
    ------------
    >>> print_ans(3,0,1)
    B
    >>> print_ans(3,2,5)
    A
    >>> print_ans(2,5,9)
    A
    """
    
    if min(abs(x-a),abs(x-b)) == abs(x-b):
      print("B")
    else:
      print("A")




if __name__ == '__main__':
    x,a,b = map(int,input().split())
    print_ans(x,a,b)

Solution (Python):



x, a, b = map(int, input().split())








if abs(x - a) <= abs(x - b):
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
def main():
    x, a, b = map(int, input().split())
    if abs(x - a) > abs(x - b):
        print('B')
    else:
        print('A')


main()

Solution (Python):
x, a, b = map(int, input().split())
if abs(x -a) < abs(x -b):
  print("A")
else:
  print("B")

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

x, a, b = nl()

if abs(a - x) < abs(b - x):
    print('A')
else:
    print('B')

Solution (Python):

import sys


def solve(x: int, a: int, b: int):
    abs_a = abs(x - a)
    abs_b = abs(x - b)

    if abs_a < abs_b:
        print('A')
    else:
        print('B')

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  
    a = int(next(tokens))  
    b = int(next(tokens))  
    solve(x, a, b)


if __name__ == '__main__':
    main()

Solution (Python):
x, a, b = map(int, input().split())

y = x - a
z = x - b
if y < 0:
    y = -1 * y

if z < 0:
    z = -1 * z

if y < z:
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int, input().split())
ra = abs(x-a)
rb = abs(x-b)
if ra < rb:
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) <= abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
print('A' if abs(x-a)<abs(x-b) else 'B')

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(x-a)<abs(x-b) else 'B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(a-x)>abs(b-x):
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(x - a) < abs(x - b) else 'B')

Solution (Python):
x,a,b = map(int, input().split())

print("A" if abs(a-x) < abs(b-x) else "B")

Solution (Python):
x,a,b = map(int, input().split())

print("A" if abs(x-a) < abs(x-b) else "B")

Solution (Python):
x, a, b = map(int,input().split())
if abs(x-a)<abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):

from collections import Counter

def main():
    x, a, b = map(int, input().split())
    if abs(x - a) < abs(b - x):
        print('A')
    else:
        print('B')



if __name__ == '__main__':
    main()

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b) :
        print('A')
else :
        print('B')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b): print("A")
else: print("B")

Solution (Python):
x, a, b = map(int, input().split())
print("A" if abs(a-x) < abs(b-x) else "B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
 print("B")
else:
 print("A")

Solution (Python):
x, a, b = map(int, input().split())

if abs(x - a) > abs(x - b):
  print("B")
else:
  print("A")

Solution (Python):
def abc():
    x, a, b = map(int, input().split())
    if abs(x -a) < abs(x - b):
        print('A')
    else:
        print('B')


abc()

Solution (Python):
x,a,b=map(int, input().split())
if abs(x-a)<abs(x-b):
  print('A')
else:
  print('B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
  print("A")
else:print("B")

Solution (Python):

import sys


def solve(x: int, a: int, b: int):
    if abs(a - x) < abs(b - x):
        ret = 'A'
    else:
        ret = 'B'
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  
    a = int(next(tokens))  
    b = int(next(tokens))  
    solve(x, a, b)

if __name__ == '__main__':
    main()

Solution (Python):
x,a,b = map(int,input().split())
da = abs(x-a)
db = abs(x-b)
if da > db:
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):


x, a, b = map(int, input().split(' '))

if abs(x-a) <= abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
a,b,c, = list(map(int,input().split(" ")))
if abs(a-b)>abs(a-c):
    print("B")
else:
    print("A")

Solution (Python):
x, a, b = [int(x) for x in input().split()]
print('A') if abs(x-a) < abs(x-b) else print('B')

Solution (Python):
x,a,b=map(int,input().split())
xa=abs(x-a)
xb=abs(x-b)
if xa<xb:
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = [int(i) for i in input().split()]
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b = map(int,input().split())

if abs(x-a)>abs(x-b):
  print("B")
  
else:
  print("A")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) > abs(x - b):
    print("B")
else:
    print("A")

Solution (Python):
x,a,b = map(int,input().split())

if(abs(x-a)< abs(x-b)):
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b): print('A')
else: print('B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int, input().split())

print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) >= abs(x - b):
    print("B")
else:
    print("A")

Solution (Python):
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)




if x < a:
  distance_xa = a - x
else:
  distance_xa = x - a


if x < b:
  distance_xb = b - x
else:
  distance_xb = x - b


if distance_xa < distance_xb:
  print("A")
else:
  print("B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(a-x)<abs(b-x):
  print("A")
else:
  print("B")

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
from _heapq import heappush, heappop

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

x,a,b = map(int,input().split())

if(abs(a-x) < abs(b-x)):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) > abs(x-b):
  print('B')
else:
  print('A')

Solution (Python):
x,a,b = map(int, input().split())
y = abs(x-a)
z = abs(x-b)
if y < z:
    print("A")
else:
    print("B")

Solution (Python):

import sys


def solve(x: int, a: int, b: int):
    if abs(x - a) > abs(x - b):
        print("B")
    else:
        print("A")
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    x = int(next(tokens))  
    a = int(next(tokens))  
    b = int(next(tokens))  
    solve(x, a, b)


if __name__ == '__main__':
    main()

Solution (Python):
X, A, B = [int(s) for s in input().split()]
print('A' if abs(X - A) < abs(X - B) else 'B')

Solution (Python):

import sys
input = sys.stdin.readline

x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
    ans = 'B'
else:
    ans = 'A'
print(ans)

Solution (Python):
x, a, b = [ int(v) for v in input().split() ]

xa = abs(x-a)
xb = abs(x-b)

if xa >= xb:
  print("B")
else:
  print("A")

Solution (Python):
x, a, b = list(map(int, input().split()))
if abs(a-x) > abs(b-x):
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) <  abs(x-b):
  print('A')
else:
  print('B')

Solution (Python):
x,a,b = map(int,input().split())
print('A' if abs(a-x) < abs(b-x) else 'B')

Solution (Python):
x,a,b=map(int,input().split())

print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
x,a,b = map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
x, a, b = map(int,input().split())
if abs(x-a)<abs(x-b):
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) > abs(x-b) :
    print("B")
else :
    print("A")

Solution (Python):
x,a,b=map(int,input().split())

a=abs(a-x)
b=abs(b-x)

if a<b:
    print("A")

else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Solution (Python):
x,a,b = map(int, input().split())
if abs(x -a) >= abs(x - b):
    print("B")
else:
    print("A")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print('A')
else: print('B')

Solution (Python):
x,a,b=map(int,input().split())
print(["A","B"][abs(x-a)>abs(x-b)])

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Solution (Python):
s, a, b = input().split()
s, a, b = int(s), int(a), int(b)
if abs(a-s) < abs(b-s):
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = [int(i) for i in input().split()]
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
print("A" if abs(x-a)<=abs(x-b) else "B")

Solution (Python):
x,a,b = map(int, input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=[int(i) for i in input().split()]
c,d=abs(a-x),abs(b-x)
if c<d:
    print("A")
elif c>d:
    print("B")

Solution (Python):

l = list(map(int, input().split()))

if abs(l[0] - l[1]) < abs(l[0] - l[2]):
    print('A')
else:
    print('B')

Solution (Python):
x, a, b = map(int,input().split())
if abs(x - a) > abs(x - b):
    print("B")
else:
    print("A")

Solution (Python):
a, b, c = map(int, raw_input().split())
aa = 0
bb = 0
if a > b:
    aa = a - b
elif a < b:
    aa = b - a
if a > c:
    bb = a - c
elif a < c:
    bb = c - a
if aa > bb:
    print "B"
else:
    print "A"

Solution (Python):
x,a,b = map(int,input().split(' '))
if abs(x-a) > abs(x-b):
  print('B')
else:
  print('A')

Solution (Python):
x,a,b=map(int,input().split())
print('B' if abs(x-a)>abs(x-b) else 'A')

Solution (Python):

x,a,b = map(int, input().split())
print("B") if abs(a-x)>abs(b-x) else print("A")

Solution (Python):
a, b, c = map(int, input().split())
if((a-b) ** 2 < (a-c)**2):
  print("A")
else:
  print("B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
x,a,b=map(int,input().split())
print("A" if abs(a-x) < abs(b-x) else "B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(a-x)<abs(b-x):
  print('A')
else:
  print('B')

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
x,a,b=map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a)>abs(x-b):
  print("B")
else:
  print("A")

Solution (Python):
import sys


def input():
    return sys.stdin.readline()[:-1]








x, a, b = map(int, input().split())
if abs(x-a)>abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
x,a,b = map(int,input().split())

if abs(a - x) < abs(b - x):
  print("A")
else:
  print("B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(a-x)<abs(b-x): print('A')
else: print('B')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
  print("A")
else:
  print("B")

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
X,A,B=map(int,input().split())
print(["A","B"][abs(X-A)>abs(X-B)])

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b = map(int,input().split())
print('A') if abs(x-a) < abs(x-b) else print('B')

Solution (Python):
x,a,b = map(int,input().split())
s = abs(x-a)
t = abs(x-b)
if s>t:
    print("B")
else:
    print("A")

Solution (Python):
a,s,d=map(int,input().split())
if abs(a-s)>abs(a-d):
  print("B")
else:
  print("A")

Solution (Python):
x,a,b = map(int,input().split())
print('A'if abs(a-x)<abs(b-x) else 'B')

Solution (Python):
l = [int(i) for i in input().split()]
print('A' if abs(l[0]-l[1])<abs(l[0]-l[2]) else 'B')

Solution (Python):
x,a,b=map(int,input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):
x, a, b =[int(i) for i in input().split()]
if abs(a-x) < abs(b-x):
  print("A")
else:
  print("B")

Solution (Python):
x,a,b=map(int,input().split())
print('A' if  abs(x-a) < abs(x-b) else 'B')

Solution (Python):
X,A,B = map(int,input().split(" "))
A = abs(X - A)
B = abs(X - B)
print("A" if A<B else "B")

Solution (Python):
x, a, b = map(int, input().split())

print("A" if (abs(x - a) < abs(x - b)) else "B")

Solution (Python):
x,a,b = map(int, input().split())
if abs(x-a) > abs(x-b):
	print('B')
else:
	print('A')

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):

def read_input():
    x, a, b = map(int, input().split())
    return x, a, b

def submit():
    x, a, b = read_input()

    if abs(x - a) < abs(x - b):
        print('A')
    else:
        print('B')

if __name__ == '__main__':
    submit()

Solution (Python):
x,a,b=map(int, input().split())

A=abs(x-a)

B=abs(x-b)

if A>B:
  print("B")
else:
  print("A")

Solution (Python):
a, b, c= map(int, input().split())
if abs(a-b) > abs(a-c):
  print("B")
else:
  print("A")

Solution (Python):
x,a,b = map(int,input().split())

if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
x,a,b = map(int,input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x,a,b = f()

    if abs(x-a) <= abs(x -b):
        print('A')
    else:
        print('B')

solve()

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
  print("B")
else:
  print("A")

Solution (Python):
x,a,b = list(map(int, input().split()))
print("A" if abs(a-x) < abs(b-x) else "B")

Solution (Python):

import sys
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(x: int, a: int, b: int):
    return 'A' if abs(a - x) < abs(b - x) else 'B'


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  
    a = int(next(tokens))  
    b = int(next(tokens))  
    result = solve(x, a, b)
    print(result)

if __name__ == '__main__':
    main()

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    ans="A"
else:
    ans="B"
print(ans)

Solution (Python):
x,a,b=map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    x, a, b = (int(_) for _ in input().split())
    if (abs(x-a) > abs(x-b)):
        print('B')
    else:
        print('A')
    
if __name__ == '__main__':
    main()

Solution (Python):
x, a, b = map(int, input().split())

if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Solution (Python):
x,a,b = map(int, input().split())
print("B" if abs(x-a)>abs(x-b) else "A")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
  print('B')
else:
  print('A')

Solution (Python):


x, a, b = map(int, input().split())

print('A' if abs(x - a) < abs(x - b) else 'B')

Solution (Python):
x, a, b = (int(i) for i in input().split())
if abs(a-x) > abs(b-x):
  print("B")
else:
  print("A")

Solution (Python):
x, a, b = map(int, input().split())

if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
  print('A')
else:
  print('B')

Solution (Python):
a,b,c=map(int,input().split())
print(["A","B"][abs(a-b) > abs(a-c)])

Solution (Python):
x,a,b = map(int,input().split())

if abs(x - a) > abs(x - b):
  print('B')
else:
  print('A')

Solution (Python):
a,b,c=map(int,input().split())
print("A" if abs(a-b)<abs(a-c) else "B")

Solution (Python):
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    X, A, B = getIntList()
    if abs(X-A) < abs(X-B):
        return 'A'
    else:
        return 'B'


ans = prob()
print(ans)

Solution (Python):
x,a,b = map(int,input().split())
if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Solution (Python):
x, a, b = map(int, input().split())
dis_a = abs(x-a)
dis_b = abs(x-b)
print('A' if dis_a < dis_b else 'B')

Solution (Python):
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


x, a, b = inl()
print('A' if abs(x - a) < abs(x - b) else 'B')

Solution (Python):
x , a, b = map(int,input().split())
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):

x, a, b = list(map(int, input().rstrip().split()))
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
x,a,b=map(int, input().split())

if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):

import copy
import random
import bisect 
import math

x,a,b = map(int,input().split())


if abs(x-a) > abs(x-b):
    print("B")
else:
    print("A")

Solution (Python):
a,b,c=map(int,input().split())
if abs(b-a)>=abs(c-a):
  print("B")
else:
  print("A")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) < abs(b - x):
	print("A")
else:
	print("B")

Solution (Python):
x,a,b = map(int,input().split())

xa = abs(a-x)
xb = abs(b-x)

if xa > xb:
    print("B")
else:
    print("A")

Solution (Python):
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
    ans = 'A'
else:
    ans = 'B'
print(ans)

Solution (Python):
x, a, b = map(int, input().split())

print("A" if abs(a - x) < abs(b - x) else "B")

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b = map(int,input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Solution (Python):
x,a,b=map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = map(int, input().split())
if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Solution (Python):
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
  print("B")
else:
  print("A")

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Solution (Python):
x,a,b = map(int,input().split())
A = abs(a-x)
B = abs(b-x)
if A < B :
    print('A')
elif A > B :
    print('B')

Solution (Python):
x,a,b=map(int,input().split())
print('A') if abs(a-x)<abs(b-x) else print('B')

Solution (Python):
x, a, b = map(int, input().split())
print('A' if abs(x - a) < abs(x - b) else 'B')

Solution (Python):
x, a, b = map(int, input().split())

if abs(a-x) < abs(b-x):
  print("A")
else:
  print("B")

Solution (Python):
x, a, b = [int(n) for n in input().split()]

print('A' if abs(x-a) < abs(b-x) else 'B')

Solution (Python):
x,a,b=map(int,input().split())
if abs(a-x) > abs(b-x):
  print('B')
else:
  print('A')

Solution (Python):
x, a, b = list(map(int, input().split()))
print("AB"[abs(x-a) > abs(x-b)::2])