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):
l = input().split()
x = float(l[0])
a = float(l[1])
b = float(l[2])


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

Solution (Python):
def solve(): 
    x, A, B = list(map(int, input().split(" ")))
    da = abs(x - A)
    db = abs(x - B)
    if da > db:
        print("B")
    else:
        print("A")


solve()

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

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

Solution (Python):

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

a = l[1] - l[0]
b = l[2] - l[0]
list = []
list.append(abs(a))
list.append(abs(b))
if list[0] > list[1]:
    print("B")
else:
    print("A")

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

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

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

Solution (Python):
import sys

a = map(int,raw_input().strip().split(" "))

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

Solution (Python):

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

print("AB"[abs(x-a) > abs(x-b)])

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

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

alpha = math.fabs(x-a)
beta = math.fabs(x-b)

if alpha>beta:
	print('B')
else:
	print('A')

Solution (Python):
import math
x,a,b = input().split()
x = int(x,10)
a = int(a,10)
b = int(b,10)
alpha = a - x
beta = b - x
alpha = math.fabs(alpha)
beta = math.fabs(beta)
if alpha > beta:
    print('B')
else:
    print('A')

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

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())
if abs(x - a) < abs(x - b):
    print("A")
elif abs(x - a) > abs(x - b):
    print("B")

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    x,a,b = LI()
    if abs(x-a) > abs(x-b):
        return 'B'

    return 'A'

print(main())

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, raw_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 (x-a)**2 < (x-b)**2:
	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("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 math

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

if math.fabs(x-a) < math.fabs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
line = input().split(" ")
A = abs(int(line[0]) - int(line[1]))
B = abs(int(line[0]) - int(line[2]))

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 = list(map(int, input().split()))
if abs(x - a) > abs(x - b):
    print ("B")
else:
    print ("A")

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 = [int(i) for i in 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()]
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)
if A<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(' '))

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

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

    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,A,B=map(int,input().split())
print('A' if abs(X-A) < abs(X-B) else '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, raw_input().split())

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

Solution (Python):
x,a,b=[int(x) for x in input().split()]
import math
if math.fabs(x-a)<math.fabs(x-b):
    print("A")
else:
    print("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())
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

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

Solution (Python):


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

Solution (Python):
a = list(map(int, input().split()))
if abs(a[0] - a[1]) > abs(a[0] - a[2]):
    print("B")
else:
  	print("A")

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

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

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

Solution (Python):
myinput=input()
a=[int(x) for x in myinput.split()]
if abs(a[0]-a[1])<abs(a[0]-a[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):
lst = list(map(int, input().split()))

x = lst[0]
a = lst[1]
b = lst[2]

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

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())
print("A" if abs(x-a) < abs(x-b) else "B")

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

a()

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(" "))
x_a = abs(x-a)
x_b = abs(x-b)
if min(x_a, x_b) ==  x_a:
    print("A")
else:
    print("B")

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

Solution (Python):

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


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

res = 'A' if disA<disB else 'B'
print(res)

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

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

Solution (Python):
tmp=map(int, raw_input().split(" "))
a=abs(tmp[0]-tmp[1])
b=abs(tmp[0]-tmp[2])
if a<b:
    print("A")
else:
    print("B")

Solution (Python):
a = map(int, raw_input().strip().split())
da = max(a[1],a[0])-min(a[1],a[0])
db = max(a[0],a[2])-min(a[0],a[2])
if da > db:
	print('B')
else:
	print('A')

Solution (Python):
x,a,b = map(int,input().split(' '))
c = a-x
d = b-x

if c<0:
	e = -c
else:
	e = c

if d<0:
	f = -d
else:
	f = d


if e<f:
	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=list(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(' '))

dist_atox = abs(a-x)
dist_btox = abs(b-x)
y = dist_atox - dist_btox

print("A" if y < 0 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 x < a and x < b:
    if a < b:
        print("A")
    else:
        print("B")
elif x > a and x > b:
    if a > b:
        print("A")
    else:
        print("B")
else:
    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):
import sys

x, a, b = map(int, sys.stdin.readline().strip().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=[int(x) for x 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('B')
else:
    print('A')

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

Solution (Python):
location_list = list(map(int, input().split()))

ax_length = abs(location_list[0] - location_list[1])
bx_length = abs(location_list[0] - location_list[2])

if ax_length < bx_length:
    print('A')
else:
    print('B')

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

Solution (Python):
import math

x,a,b=list(map(int,input().split()))
if(math.fabs(x-a)>math.fabs(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):


nvm = input().split(' ')
if abs(int(nvm[0]) - int(nvm[1])) < abs(int(nvm[0]) - int(nvm[2])):
    print('A')
else:
    print('B')

Solution (Python):
import math


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

if(math.fabs(x[1]-x[0])-math.fabs(x[2]-x[0]) > 0):
    print('B')
    quit()
else:
    print('A')
    quit()


quit()

Solution (Python):
x,a,b=map(float,raw_input().split())
AX=abs(a-x)
BX=abs(b-x)
if AX>BX:
    print "B"
else:
    print "A"

Solution (Python):
x = map(int, raw_input().split())

place = x[0]
a     = x[1]
b     = x[2]

dist_a = abs(place - a)
dist_b = abs(place - b)

if dist_a < dist_b:
    print('A')
else:
    print('B')

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

Solution (Python):
def main():
    X, A, B = map(int, input().split())

    if abs(A - X) < abs(B - X):
        ans = 'A'
    else:
        ans = 'B'
    print(ans)

main()

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(i) for i in input().split())

a = a-x if a>x else x-a
b = b-x if b>x else x-b

ans = "A" if a<b else "B"

print(ans)

Solution (Python):


mozir=input()
hyo=mozir.split(' ')
X=int(hyo[0])
A=int(hyo[1])
B=int(hyo[2])

A_Dist=abs(X-A)
B_Dist=abs(X-B)

if A_Dist > B_Dist :
    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, raw_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 = (int(i) for i in input().split())
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Solution (Python):
x,a,b=list(map(int,raw_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())
aa = abs(a-x)
bb = abs(b-x)
if aa > bb:
    print("B")
else:
    print("A")

Solution (Python):
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

x, a, b = read_line(int, int, int)

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

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

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

Solution (Python):
def A_MealDelivery(lst):
    x, a, b = lst[0], lst[1], lst[2]
    if abs(x - a) < abs(x - b):
        return 'A'
    else:
        return 'B'

l = [int(i) for i in input().split()]
print(A_MealDelivery(l))

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, a, b = int(x), int(a), int(b)

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

if dis_a < dis_b:
    print("A")
else:
    print("B")

Solution (Python):
x, a, b = map(int, input().split())
disA = abs(x-a)
disB = abs(x-b)
if disA < disB:
    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 = list(map(int, input().split(' ')))

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

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

    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())
print("A" if abs(x-a)<abs(x-b) else "B")

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys




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


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


def read_int():
    return int(input())


def read_str():
    return input()


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


main()

Solution (Python):
a = input().split()
if (max(int(a[0]), int(a[1])) - min(int(a[0]), int(a[1]))) > (max(int(a[0]), int(a[2])) - min(int(a[0]), int(a[2]))):
    print("B")
elif (max(int(a[0]), int(a[1])) - min(int(a[0]), int(a[1]))) < (max(int(a[0]), int(a[2])) - min(int(a[0]), int(a[2]))):
    print("A")

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,raw_input().split())
a=abs(x-a)
b=abs(x-b)
if a<b :
    print 'A'
else :
    print 'B'

Solution (Python):



nab = raw_input()
nab = nab.split()
n,a,b = map(int,nab)

if abs(n-a) < abs(n-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(a-x)<abs(b-x):
    print("A")
else:
    print("B")

Solution (Python):


x,a,b = map(float,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('B')
else:
    print('A')

Solution (Python):
n, a, b = map(int, raw_input().split())

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

Solution (Python):

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

if(math.copysign(x-a,0) < math.copysign(x-b,0)):
    print('A')
else:
    print('B')

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

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

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

if (x-a)**2 >(x-b)**2:
    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())

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

Solution (Python):


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

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

print("A" if d1 < d2 else "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('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(a-x) < abs(b-x) else 'B'
print(ans)

Solution (Python):
x,a,b=map(int,raw_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(a-x) < abs(b-x):
    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):
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, raw_input().split())
print 'A' if abs(x - a) < abs(x - b) else 'B'

Solution (Python):

def main():
    x, a, b = (int(z) for z in input().split())

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
inp = lambda t: t(sys.stdin.readline().strip())
inpm = lambda t: map(t, sys.stdin.readline().split())
inpl = lambda t: list(map(t, sys.stdin.readline().split()))
print = lambda x, end='\n': sys.stdout.write(str(x) + end)

x, a, b = inpm(int)
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('B')
else:
    print('A')