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



Sample input:
5 2 7


Sample output:
B

Submission status: Accepted

Solution code:
base, shopA, shopB = map(int, input().split())
if abs(base - shopA) < abs(base - shopB):
  print("A")
else:
  print("B")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
if min(abs(n-a), abs(n-b)) == abs(n-a):
    print('A')
else:
    print('B')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#71a
x,a,b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Meal Delivery
x, a, b = map(int, input().split())
absa = abs(x-a)
absb = abs(x-b)
if absa < absb:
    print("A")
else:
    print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

x, a, b = map(int, stdin.readline().split())
print('A' if abs(a - x) < abs(b - x) else "B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x, a, b = map(int, input().split())
if(abs(x-a) <= abs(x-b)):
  print('A')
else:
  print('B')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b = (int(x) for x in input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC071 A - Meal Delivery
x,a,b = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
INPUT = list(map(int,input().split()))
x=INPUT[0]
a=INPUT[1]
b=INPUT[2]
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = [int(s) for s in input().split()];print("AB"[abs(x-a) > abs(x-b)])

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
if x > a:
  xa = x-a
else:
  xa = a-x
if x > b:
  xb = x-b
else:
  xb = b-x
if xa > xb:
  print("B")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    x, a, b = list(map(int, input().rstrip('\n').split()))
    if abs(x - a) < abs(x - b):
        print("A")
    elif abs(x - a) > abs(x - b):
        print("B")


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,A,B=input().split()
x=int(X)
a=int(A)
b=int(B)
if x>a:
  p=x-a
else:
  p=a-x
if x>b:
  q=x-b
else:
  q=b-x
if p<q:
  print("A")
else:
  print("B")

Submission status: Accepted

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

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

if l_1<l_2:
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
print('A' if abs(A[0]-A[1]) <= abs(A[0]-A[2]) else 'B')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
routeA = abs(x-a)
routeB = abs(x-b)

if routeA < routeB:
        print("A")
else:
        print("B")

Submission status: Accepted

Solution code:
#2019/09/26
x, a, b = map(int, input().split())
print("A" if min(abs(x-a), abs(x-b)) == abs(x-a) else "B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c=INTM()
    if abs(a-b)>=abs(a-c):
        print('B')
    else:
        print('A')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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
#print("distance_xa =", distance_xa)
if x < b:
  distance_xb = b - x
else:
  distance_xb = x - b
#print("distance_xb =", distance_xb)
if distance_xa > distance_xb:
  print("B")
else:
  print("A")

Submission status: Accepted

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

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

if diff_a < diff_b:
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


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

Submission status: Accepted

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

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

if a_dis<b_dis:
  print('A')
else:
  print('B')

Submission status: Accepted

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

x_a = (x - a) ** 2
x_b = (x - b) ** 2
	


if x_a > x_b:
	print("B")

else:
	print("A")

Submission status: Accepted

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

if x > a:
	x_a = x - a
else:
	x_a = a - x

if x > b:
	x_b = x - b
else:
	x_b = b - x
	
if x_a > x_b:
	print("B")
else:
	print("A")

Submission status: Accepted

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

if x > a:
	x_a = x - a
else:
	x_a = a - x

if x > b:
	x_b = x - b
else:
	x_b = b - x
	


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

Submission status: Accepted

Solution code:
x,a,b = input().split()
x = int(x)
a = int(a)
b = int(b)
# print("x = ", x)
# print("a = ", a)
# print("b = ", b)

if x < a:
    distance_xa = a - x
else:
    distance_xa = x - a
# print("distance_xa = ", distance_xa)

if x < b:
     distance_xb = b - x
else:
     distance_xb = x - b
# print("distance_xb = ", distance_xb) 

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

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
# print("x = ", x)
# print("a = ", a)
# print("b = ", b)

if x < a:
    distance_xa = a - x
else:
    distance_xa = x - a
# print("distance_xa = ", distance_xa)

if x < b:
    distance_xb = b - x
else:
    distance_xb = x - b
# print("distance_xb = ", distance_xb)

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

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
 #print("x = ", x)
 #print("a = ", a)
 #print("b = ", b)

if x < a:
    distance_xa = a - x
else:
    distance_xa = x - a
 #print("distance_xa = ", distance_xa)

if x < b:
    distance_xb = b - x
else:
    distance_xb = x - b
 #print("distance_xb = ", distance_xb)

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
#print("x =", x)
#print("a =", a)
#print("b =", b)

if x < a:
  xa = a - x
else:
  xa = x - a
  
if x < b:
  xb = b - x
else:
  xb = x - b

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

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
# print("x = ", x)
# print("a = ", a)
# print("b = ", b)

if x < a:
  distance_xa = a-x
else:
  distance_xa = x-a
# print("distance_xa = ", distance_xa)

if x < b:
  distance_xb = b-x
else:
  distance_xb = x-b
# print("distance_xb = ", distance_xb)

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

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
# print("x =", x)
# print("a =", a)
# print("b =", b)

if x < a:
    distance_xa = a - x
else:
    distance_xa = x - a
# print("distance_xa =", distance_xa)

if x < b:
    distance_xb = b - x
else:
    distance_xb = x - b
# print("distance_xb =", distance_xb)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC071A
import math
x, a, b =list(map(int, input().split()))

ax = math.fabs(a-x)
bx = math.fabs(b-x)

if (ax < bx): print("A")
else: print('B')

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if dist1 > dist2:
    print('B')
else:
    print('A')

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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

if b < x:
    b_abs = x-b
else:
    b_abs = b-x
if a_abs > b_abs:
    print("B")
else:
    print("A")

Submission status: Accepted

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

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

if a>x:
    s=a-x
else:
    s=x-a

if b>x:
    t=b-x
else:
    t=x-b
    
if s<t:
    print('A')
else:
    print('B')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input().split())
x=int(s[0])
a=int(s[1])
b=int(s[2])
ave=(a+b)/2
if ave>x:
  if b>a:
    print('A')
  else:
    print('B')
else:
  if b>a:
    print('B')
  else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b = (int(i) for i in input().split())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input().split()
x, a, b = int(N[0]), int(N[1]), int(N[2])
s = abs(x - a)
t = abs(x - b)
if s > t:
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
  print('A')

Submission status: Accepted

Solution code:
print((lambda x:["A", "B"][abs(x[0]-x[1]) > abs(x[0]-x[2])]) (list(map(int,input().split()))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split());print('A'*(abs(a-x)<abs(b-x))or'B')

Submission status: Accepted

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



if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if min([ax,bx])==ax:
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
(x, a, b) = (int(tok) for tok in input().split())
dist_a = abs(x - a)
dist_b = abs(x - b)

print("A" if dist_a == min(dist_a, dist_b) else "B")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def ABS(a,b):
  c = a - b
  if c < 0:
    c = c * -1
  return c

str = input()
nli = list(map(int,str.split()))

if ABS(nli[0],nli[1]) < ABS(nli[0],nli[2]):
  print("A")
else:
  print("B")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#71

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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