Meal Delivery

AtCoder

IDabc071_a

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

5 2 7

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`.

Input #2

1 999 1000

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Meal Delivery",
    "description": {
      "content": "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 fro",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc071_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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.\nSnuke decided to get food delivery fro...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments