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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

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

x,a,b = inpl()
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:
#-*-coding:utf-8-*-

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

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
n[1]=abs(n[0]-n[1])
n[2]=abs(n[0]-n[2])
if(n[1]>n[2]):
  print("B")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

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

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("B")
else:
  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 = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

input =input().split(" ")
X = int(input[0])
A = int(input[1])
B = int(input[2])
dist_XA=abs(A-X)
dist_XB=abs(B-X)

ans = "A" if(dist_XA<dist_XB) else "B"
print(ans)

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

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("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 (x-a)**2<(x-b)**2 else "B")

Submission status: Accepted

Solution code:
import numpy as np
a,b,c=map(int,input().split())
if np.abs(a-b)<np.abs(a-c):
    print('A')
elif np.abs(a-b)>np.abs(a-c):
    print('B')

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:
import math

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

if math.fabs(x - a) > math.fabs(x - b):
  print("B")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

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

stdin = sys.stdin

x,a,b = list(map(int, stdin.readline().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())
A = abs(a-x) 
B = abs(b-x)

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

Submission status: Accepted

Solution code:
def judge(x, a, b):
	if abs(a-x) < abs(b-x): return 'A'
	else: return 'B'

x, a, b = map(int, raw_input().split())
print judge(x, a, 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());print(['A','B'][abs(x-a)>abs(x-b)])

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print(sorted([["A", a], ["B", b]], key=lambda y: abs(x - y[1]))[0][0])

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

Submission status: Accepted

Solution code:
a, b, c = list(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())
s = (x - a) **2 
t = (x - b) **2
if s > t :
    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(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(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 = 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 = 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 = map(int, input().split())

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

x = int(arr_data[0][0])
a = int(arr_data[0][1])
b = int(arr_data[0][2])


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_data=input().split()
x=int(input_data[0])
a=int(input_data[1])
b=int(input_data[2])
if abs(a-x)<abs(b-x):print("A")
else:print("B")

Submission status: Accepted

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

Submission status: Accepted

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

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    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:
#-*- coding: utf-8 -*-
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().rstrip().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=[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 = list(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
line = stdin.readline
x,a,b = map(int, line().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=(x-a)**2
B=(x-b)**2
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:
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())
disa=abs(a-x)
disb=abs(b-x)
if(disa<disb):
  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())
sa=abs(x-a)
sb=abs(x-b)
if sa<sb:
    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()))

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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-



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

    da = abs(X-A)
    db = abs(X-B)

    if da < db:
        print("A")
    elif da > db:
        print("B")
    else:
        assert False

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 = [int(x) for x in input().split()]
print("A") if abs(x-a)<abs(x-b) else print("B")

Submission status: Accepted

Solution code:
x,a,b = [int(i) for i in 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(a-x) < abs(b-x) 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:
n = list(map(int,input().split()))
if abs(n[0] - n[1]) < abs(n[0] - n[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:
#!/usr/bin/env python

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())
p = abs(x-a)
q = abs(x-b)
if p < q:
    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 = list(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())
import math
if abs(a-b) > abs(a-c):
 print("B")
else:
 print("A")

Submission status: Accepted

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

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

if d1 > d2:
	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 = list(map(int, input().split()))

import math
if abs(x[1] - x[0]) < abs(x[2] - x[0]):
    print("A")
else:
    print("B")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
inp = input().split()
x = int(inp[0])
a = int(inp[1])
b = int(inp[2])
disA = abs(a-x)
disB = abs(b-x)
if(disA > disB):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
A, B = abs(x - a), 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:
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
a=i2()
if abs(a[0]-a[1])>abs(a[0]-a[2]):
  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, raw_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:
if __name__ == '__main__':
    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,raw_input().split())
print "B" if abs(a-x)>abs(b-x) else "A"

Submission status: Accepted

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

X, A, B = [i for i in place]

X_A = abs(X - A)
X_B = abs(X - B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10
 
 
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:
# -*- 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:
n,a,b = map(int,input().split())
a=abs(n-a)
b=abs(n-b)
print("A" if a<b else "B")

Submission status: Accepted

Solution code:
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10


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

Submission status: Accepted

Solution code:
n = input().split()
xab = []
for i in n:
    xab.append(int(i))
xa = abs(xab[0] - xab[1])
xb = abs(xab[0] - xab[2])
if xa < xb:
    print('A')
elif xa > xb:
    print('B')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する

a_distant = a - x
b_distant = b - x
if a_distant < 0:
    a_distant = a_distant*(-1)
if b_distant < 0:
    b_distant = b_distant*(-1)
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split());print('AB'[(2*x>a+b)^(a>b)])

Submission status: Accepted

Solution code:
print((lambda x:"A" if abs(x[0]-x[2]) > abs(x[0]-x[1]) else "B")([int(i) for i in input().split()]))

Submission status: Accepted

Solution code:
inp = raw_input()#raw_input accept number and literary,input accept number only
list = inp.split()
x = int(list[0])
a = int(list[1])
b = int(list[2])
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-b) > abs(x-a):
  print('A')
else:
  print('B')

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
input_value = input().split()
x = int(input_value[0])
a = int(input_value[1])
b = int(input_value[2])

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

if distance_from_x_to_a < distance_from_x_to_b:
	print("A")
else:
	print("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("A")
if B<A:
    print("B")

Submission status: Accepted

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

line = input()
nums = line.split()
x = int(nums[0])
a = int(nums[1])
b = int(nums[2])

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

print(ans)

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

Submission status: Accepted

Solution code:
def solve(): # 071A - Meal Delivery
    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()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
#! /bin/python
# coding:utf-8

(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 = [int(i) for i in input().split()]
if (x-a)**2 < (x-b)**2:
	print("A")
else:
	print("B")

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

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(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()]
if abs(A-X) <= abs(B-X):
    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("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 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:
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:
# -*- coding:utf-8 -*-
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:
# coding: utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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