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 C# (Mono 4.6.2.0) (judge verdict: Runtime Error)


using System;
using System.Linq;
class GFG
{
    public static void Main()
    {
        //var input = Console.ReadLine().Split(' ');

        //var x = int.Parse(input[0]);
        //var a = int.Parse(input[1]);
        //var b = int.Parse(input[2]);

        var n = int.Parse(Console.ReadLine());
        // var ss = str.ToCharArray().OrderBy(x => x).ToArray();
        var s1 = Console.ReadLine();
        var s2 = Console.ReadLine();

        ColoringDominos(n, s1, s2);
    }

    static void ColoringDominos(int n, string s1, string s2)
    {

        long mod = 1000000007;
        int i = 0;
        long ans = 1;
        int start = 0;
        int partern = 0;
        if (s1[0] == s2[0])
        {
            ans = ans * 3;
            partern = 1;
            i = 1;
        }
        else
        {
            ans = ans * 6;
            partern = 2;
            i = 2;
        }

        while (i < n)
        {
            if (s1[i] == s2[i])
            {
                i++;
                if (partern == 1)
                {
                    ans = ans * 2;

                }
                else
                {
                    partern = 1;
                }
                ans = ans % mod;

            }
            else
            {
                i += 2;
                if (partern == 1)
                {
                    ans = ans * 2;
                    partern = 2;
                }
                else
                {
                    ans = ans * 3;
                }
                ans = ans % mod;
            }
        }
        Console.Write(ans);
    }



}