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: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,a,b = input().split()
x = int(x)
a = int(a)
b = int(b)
if (x-a)^2 <= (x-b)^2 :
 print(a)
else :
 print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(min(abs(a-x),abs(b-x)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

else:
  print('B')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

print(min(abs(x-a),abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
for i  in range(ord("a"),ord("z")+1):
  if chr(i) not in s:
    print(chr(i))
    break
else:
  print("None")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import itertools
s = input()
cnt = ord('a')
for k, _ in itertools.groupby(sorted(s)):
  if not cnt == ord(k):
    break
  cnt += 1
print([chr(cnt), 'None'][cnt>ord('z')])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
ans = 'None'
for letter in "abcdefghijklmnopqrstuvwxyz":
    if letter not in S:
        ans = letter
        break
print(ans)

Submission status: Wrong Answer

Solution code:
S = list(input())
s = set(S)
S = list(s)
S.sort()
if len(S) == 26:
    print (None)
else:
    tmp = 0
    for i in 'abcdefghijklmnopqrstuvwxyz':
        if tmp >= len(S):
            print (i)
            break
        if i == S[tmp]:
            tmp += 1
        else:
            print (i)
            break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

m, b, c = MAP()
# print(min(abs(a - c), abs(a - b)))
if m - b < m - c:
    print("A")
else:
    print("B")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=sorted(set([v for v in input()]))
alphabets = "abcdefghijklmnopqrstuvwxyz"
answer = None
for i, (s,a) in enumerate(zip(S,alphabets)):
  if s != a:
    answer = a
    break
if answer == None and i<25:
  answer = alphabets[i+1]
#print(S)
print(answer)

Submission status: Wrong Answer

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

A = a - x
B = b - x

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

Submission status: Wrong Answer

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

A = x - a
B = x - b

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

Submission status: Wrong Answer

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

A = x - a
B = x - b

print(min(A,B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    Examples
    ------------
    >>> print_ans(3,0,1)
    2
    >>> print_ans(3,2,2)
    1
    >>> print_ans(2,5,9)
    3
    """
    print(min(abs(x-a),abs(x-b)))



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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def smaller(x, y):
	if x < y: return x
	return y
x, a, b = map(int, input().split())
print(smaller(abs(x-a), abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a=a-x
b=b-x

if a<b:
    print("A")

else:
    print("B")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC071A - Meal Delivery
x, a, b = list(map(int, input().rstrip().split()))
print(min(abs(x - a), abs(x - b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
x,a,b=input().split()
print(min(abs(int(x)-int(a)),abs(int(x)-int(b))))

Submission status: Wrong Answer

Solution code:
x, a, b = map(int, input().split())
ans = min(abs(x-a),abs(x-b))
print(ans)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
from collections import  Counter
s = list(sorted(str(input())))
l = list(Counter(s))
a = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

if len(l) == 26:
    print('None')
else:
    for i in range(len(l)):
        if l[i]!=a[i]:
            print(a[i])
            break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

xa = x - a
xb = b - x

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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 a[2]-a[0] > a[1]-a[0]:
    print(a[1])
else: print(a[2])

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(max(abs(x-a), abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
S = input()
S_list = list(set(S))
al = 'abcdefghijklmnopqrstucwxyz'
al_list = list(al)
S_list.sort()

for i in range(len(set(S))):
    if al_list[i] in S_list:
        pass
    else:
        print(al_list[i])
        break
    
if i == len(set(S)) - 1:
    print('None')

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
MOD = 1000000007

def m():
    N = int(input())
    if N == 1:
        return 3
    s = str(input())
    s2 = str(input())
    a = []
    past = s[0]
    point = 0
    while point < len(s):
        if s[point] == s[point+1]:
            a.append('y')
            point += 2
        else:
            a.append('x')
            point += 1

        if point == len(s) -1:
            a.append('x')
            break

    ans = 0
    if a[0] == 'x':
        ans = 3
    else:
        ans = 6

    for j in range(1, len(a)):
        if a[j-1] == 'x' and a[j] == 'x':
            ans *=2 % MOD
        elif a[j-1] == 'y' and a[j] == 'x':
            ans *=1 % MOD
        elif a[j-1] == 'x' and a[j] == 'y':
            ans *=2 % MOD
        elif a[j-1] == 'y' and a[j] == 'y':
            ans *=3 % MOD

    return ans % MOD

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
al = "abcdefghijklmnopqrstuvwxyz"
S1 = list(set(sorted(input())))
if (len(S1)==26):
    print("None")
else:
    for i in range (len(S1)):
        if al[i] != S1[i]:
            print(al[i])
            break
    print(al[len(S1)])

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
print(["A", "B"][abs(A-B) < abs(A-C)])

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
print(["A", "B"][abs(A-B) < abs(B-C)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print('<入力>')
print('自宅の位置x,店Aの位置a,店Bの位置b')
XAB = input('>>>')
xab = XAB.split(' ')

ya = int(int(xab[0]) - int(xab[1]))
yb = int(int(xab[0]) - int(xab[2]))

if int(ya) < 0:
    ya = int(int(ya) * -1)
if int(yb) < 0:
    yb = int(int(yb) * -1)

print('<出力>')
y = int(int(ya) - int(yb))
if y > 0:
    print('B')
elif y < 0:
    print('A')

Submission status: Wrong Answer

Solution code:
S = input()
alphabet = "abcdefghijklmnopqrstuvwxyz"
found = [i for i in alphabet if i not in S]
found.sort()
if len(found) == 0:
  print('None')
else:
  print(found[0])

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Here your code !
n = input()
if n.find('9') >= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する
if a < 0:
    a = a*(-1)
if b < 0:
    b = b*(-1)
a_distant = a - x
b_distant = b - x
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
else:
    print("A")

Submission status: Wrong Answer

Solution code:
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する
a_distant = (a - x)^2
b_distant = (b - x)^2
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
if b_distant > a_distant:
    print("A")

Submission status: Wrong Answer

Solution code:
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する
a_distant = (a - x)^2
b_distant = (b - x)^2
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
else:
    print("A")

Submission status: Wrong Answer

Solution code:
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する
a_distant = a - x
b_distant = b - x
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
if b_distant > a_distant:
    print("A")
else:
    print("false")

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=sorted(set(chr(97+i) for i in range(26))-set(input()))
print("None" if not x else x[0])

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
l = input().split()
x = int(l[0])
t = int(l[1])
y = x - t
print('{0}'.format(y))

Submission status: Wrong Answer

Solution code:
import sys

alphabet = "abcdefghijklmnopqrstuvwxyz"
word = raw_input()

for letter in alphabet:
    if letter not in word:
        break

if letter == "z":
    print "None"
else:
    print letter

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#ABC071A

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

Submission status: Wrong Answer

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

s=x-a
if(s<0):
 s=-s
t=x-b
if(t,0):
 t=-t

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    X, A, B = [int(i) for i in range(3)]
    if abs(A - X) < abs(B - X):
        print('A')
    else:
        print('B')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#from time import time
#t = time()
nvm = input().split(' ')
if abs(int(nvm[0]) - int(nvm[1])) > abs(int(nvm[0]) - int(nvm[2])):
    print('A')
else:
    print('B')

#print(mn[0] * mm[1])
#tt= time()
#print(tt-t)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
#from time import time
#t = time()
nvm = input().split(' ')
if abs(int(nvm[1]) - int(nvm[0])) > abs(int(nvm[1]) - int(nvm[2])):
    print('A')
else:
    print('B')

#print(mn[0] * mm[1])
#tt= time()
#print(tt-t)

Submission status: Wrong Answer

Solution code:
#from time import time
#t = time()
nvm = input().split(' ')
if int(nvm[1]) - int(nvm[0]) > int(nvm[1]) - int(nvm[2]):
    print('A')
else:
    print('B')

#print(mn[0] * mm[1])
#tt= time()
#print(tt-t)

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())
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 = list(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(a - b) < abs(a - c):
    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(x-a) < abs(x-b):
  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())
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):
    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:
lst = input().split()

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

def distance(p):
   return abs(p - x)

if distance(a) < distance(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:
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(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 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())
ar = abs(x - a)
br = abs(x - b)

if br < ar:
    print("B")
elif br > ar:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
with open(0) as f:
    x, a, b = map(int, f.read().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(x-a) > abs(x-b):
    print("B")
else:
    print("A")

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('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 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())
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(y-x) < abs(z-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=map(int,input().split())

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