Problem:
Score : 100 points

Problem Statement

Snuke lives at position x on a number line.
On this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.

Snuke decided to get food delivery from the closer of stores A and B.
Find out which store is closer to Snuke's residence.

Here, the distance between two points s and t on a number line is represented by |s-t|.

Constraints

1 \leq x \leq 1000

1 \leq a \leq 1000

1 \leq b \leq 1000

x, a and b are pairwise distinct.

The distances between Snuke's residence and stores A and B are different.

Input

Input is given from Standard Input in the following format:

x a b

Output

If store A is closer, print A; if store B is closer, print B.

Sample Input 1

5 2 7

Sample Output 1

B

The distances between Snuke's residence and stores A and B are 3 and 2, respectively.
Since store B is closer, print B.

Sample Input 2

1 999 1000

Sample Output 2

A

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

'use strict'

function Main(input) {
  const S = input;
  const chars = new Set();
  for (let i = 0; i < S.length; i++) {
	chars.add(S[i]);
  }

  const sorted = Array.from(chars.values()).sort();
  console.log(sorted);
  let firstChar = 'a';
  for (let c of sorted.reverse()) {
    switch(c) {
      case 'a':
        firstChar = 'b';
        break;
      case 'b':
        firstChar = 'c';
        break;
      case 'c':
        firstChar = 'd';
        break;
      case 'd':
        firstChar = 'e';
        break;
      case 'e':
        firstChar = 'f';
        break;
      case 'f':
        firstChar = 'g';
        break;
      case 'g':
        firstChar = 'h';
        break;
      case 'h':
        firstChar = 'i';
        break;
      case 'i':
        firstChar = 'j';
        break;
      case 'j':
        firstChar = 'k';
        break;
      case 'k':
        firstChar = 'l';
        break;
      case 'l':
        firstChar = 'm';
        break;
      case 'm':
        firstChar = 'n';
        break;
      case 'n':
        firstChar = 'o';
        break;
      case 'o':
        firstChar = 'p';
        break;
      case 'p':
        firstChar = 'q';
        break;
      case 'q':
        firstChar = 'r';
        break;
      case 'r':
        firstChar = 's';
        break;
      case 's':
        firstChar = 't';
        break;
      case 't':
        firstChar = 'u';
        break;
      case 'u':
        firstChar = 'v';
        break;
      case 'v':
        firstChar = 'w';
        break;
      case 'w':
        firstChar = 'x';
        break;
      case 'x':
        firstChar = 'y';
        break;
      case 'y':
        firstChar = 'z';
        break;
      case 'z':
        firstChar = 'None';
        break;
    }
  }
  console.log(firstChar);
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));