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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split(' '))
if abs(a-b)<abs(c-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:
# -*- 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:
#071 A
x,a,b =map(int,input().split())
if abs(x-a) >abs(x-b):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if abs(b-a) < abs(c-a):
    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:
import sys

def main():
    input = sys.stdin.readline
    x, a, b = map(int, input().split())

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


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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
i=abs(x-a)
j=abs(x-b)
if i<j: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(x) for x in input().split()]
if(abs(a-x)<abs(b-x)):
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
def meal_delivery(x: int, a: int, b: int)->str:
    return 'A' if abs(x - a) < abs(x - b) else 'B'


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

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):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:
#ABC71
x, a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
import math

def A():
    x, a, b = [int(x) for x in input().split()]
    if abs(x-a) < abs(x-b):
        print('A')
    else:
        print('B')
def B():
    S = input()
    alphabet = [False for x in range(26)]
    for char in S:
        i = ord(char) - ord('a')
        alphabet[i] = True
    printed = False
    for i in range(len(alphabet)):
        if alphabet[i] == False:
            print(chr(ord('a')+i))
            printed = True
            break
    if printed == False:
        print("None")
def C():
    n = int(input())
    three = 0

A()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    x, a, b = LI()
    if abs(x - a) > abs(x - b):
        print("B")
    else:
        print("A")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

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

#C
"""
n = I()
d = defaultdict(int)
a = LI()
for i in a:
    d[i] += 1
d = list(d.items())
d.sort(key = lambda x:-x[0])
l = 0
k = 0
for i,j in d:
    if j >= 2:
        if l == 0:
            l = i
        else:
            k = i
        if j >= 4:
            k = i
    if k != 0:break
print(l*k)
"""

#D
"""
n = I()
s1 = S()
s2 = S()
ans = 0
i = 0
key = 1
d = defaultdict(int)
while i < n:
    if s1[i] == s2[i]:
        if not d[s1[i]]:
            d[s1[i]] = 1
            if i == 0:
                ans = 3
            else:
                if key:
                    ans *= 2
        key = 1
    else:
        if not d[s1[i]] and not d[s2[i]]:
            d[s1[i]] = 1
            d[s2[i]] = 1
            if i == 0:
                ans = 6
            else:
                if key:
                    ans *= 2
                else:
                    ans *= 3
        if not d[s1[i]]:
            d[s1[i]] = 1
            if not key:
                ans *= 2
        if not d[s2[i]]:
            d[s2[i]] = 1
            if not key:
                ans *= 2
        key = 0
        i += 1
    i += 1
    ans %= mod
print(ans)
"""

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b = (int(i) for i in 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()]
print("A" if abs(x-a)<abs(x-b) else "B")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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("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())
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:
from sys import stdin
x, a, b = [int(x) for x in stdin.readline().rstrip().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()]
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())
print(['A', 'B'][abs(A - X) > abs(B - X)])

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 print("B")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print("A") if abs(a-b)<abs(a-c) 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(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())
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())

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 = [ int(x) for x in input().split() ]

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

print(ans)
print()

Submission status: Accepted

Solution code:
x, a, b = list(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_ans = abs(x-a)
b_ans = abs(x-b)
if a_ans < b_ans:
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print('A' if abs(b-x) > abs(a-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:
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 = 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()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
xab = list(map(int, input().split()))
if abs(xab[1]-xab[0])<abs(xab[2]-xab[0]):
    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())
if abs(b-x) > abs(x-a):
    print("A")
else:
    print("B")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,A,B=map(int,input().split())
if abs(A-n)<abs(B-n):
  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 print("B")

Submission status: Accepted

Solution code:
int_x, int_a, int_b = map(int, input().split())

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

Submission status: Accepted

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

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())
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())
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(a-x) < abs(b-x) else 'B')

Submission status: Accepted

Solution code:
x,a,b = [int(i) for i in 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 = list(map(int, input().split()))

ans = "B"

if abs(x - a) < abs(x - b):
    ans = "A"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

xa = x - a
xb = b - x
if(xa<0):
    xa = -xa
if(xb<0):
    xb = -xb

if(xa < xb):
    print('A')
else:
    print("B")

Submission status: Accepted

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


abc071_a()

Submission status: Accepted

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

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

Submission status: Accepted

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

ABC()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x,a,b=map(int,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:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    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:
from statistics import mean, median,variance,stdev
import sys
import math

a = input().split()
#y = input().split()

for i in range(len(a)):
    a[i] = int(a[i])

#x = int(input())
#y = int(input())
if abs(a[2]-a[0]) > abs(a[1]-a[0]):
    print("A")
else: print("B")

Submission status: Accepted

Solution code:
X, A, B = [int(_) for _ in 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()]
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(' ')]
da = abs(x-a)
db = abs(x-b)
if da < db: 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([0,'B','A'][(abs(x-a)>abs(x-b))-(abs(x-a)<abs(x-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()]
print("B" if abs(X-a) > abs(X-b) else "A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
nums = [int(num) for num in input().split()]
x = nums[0]
a = nums[1]
b = nums[2]
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(x - a) < abs(x - b):
	print('A')
else:
	print('B')

Submission status: Accepted

Solution code:
x, a, b = [int(_) for _ in 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:
a=input().strip().split(" ")

b=[int(i) for i in a]

A=abs(b[0]-b[1])
B=abs(b[0]-b[2])

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

Submission status: Accepted

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

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

print('A' if a1 < b1 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:
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")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = map(int, raw_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()))

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):
	ans = 'B'
else:
	ans = 'A'
print(ans)

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(x-a)<abs(x-b)else'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())

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 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(["B", "A"][abs(x - a) < abs(x - b)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b=list(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())
print(["A","B"][abs(x-a)>abs(x-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:
#coding: utf-8
x, a, b = map(int, input().split())
print("AB"[abs(x-a) > abs(x-b)])

Submission status: Accepted

Solution code:
#coding: utf-8
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("B"if abs(a-x)>=abs(b-x) else "A")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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 = 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())

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

if s < t:
    print("A")

else:
    print("B")

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())
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())
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(x - b) > abs(x - a) else '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:
n = list(map(int, input().split())) # 整数

a = abs(n[0] - n[1])

b = abs(n[0] - n[2])

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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()

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());print('AB'[abs(a-x)>abs(b-x)::2])

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

Submission status: Accepted

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

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

if x2a < x2b:
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


# --------------------------------------------

dp = None


def main():
    x, a, b = li_input()

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


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())

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

Submission status: Accepted

Solution code:
x,a,b = list(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())
if abs(x-a) >= abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

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