stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

    int main()

    {

        int x,a,b;

        cin>>x>>a>>b;



        if(abs(x - a) < abs(x - b))

           cout<<"A";

           else

            cout<<"B";

    }


// Faster C++ solution for the same problem (measured speedup: 5.309632124756254x):
#include <stdio.h>



int main() {

  int z, A, B;

  scanf("%d %d %d", &z, &A, &B);

  int distA = (z > A) ? z - A : A - z;

  int distB = (z > B) ? z - B : B - z;

  (distA < distB) ? puts("A") : puts("B");

  return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cmath>



using namespace std;



int main()

{

    int a, b, c;

    cin>>a>>b>>c;

    if(abs(a - b) > abs(a - c)) cout<<"B"<<endl;

    else cout<<"A"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.321221900117567x):
#include <stdio.h>



int main() {

  int z, A, B;

  scanf("%d %d %d", &z, &A, &B);

  int distA = (z > A) ? z - A : A - z;

  int distB = (z > B) ? z - B : B - z;

  (distA < distB) ? puts("A") : puts("B");

  return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295450053172499x):
#include <stdio.h>



int main() {

	

	int x, a, b;

	scanf("%d %d %d", &x, &a, &b);

	

	int aa;

	if(a>=x){

		aa=a-x;

	}

	else{

		aa=x-a;

	}



	int bb;

	if(b>=x){

		bb=b-x;

	}

	else{

		bb=x-b;

	}

	

	if(aa<bb){

		printf("A\n");

	}

	else{

		printf("B\n");

	}



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.294951449035078x):
#include<stdio.h>

int main()

{

	int x,a,b;

	scanf("%d %d %d",&x,&a,&b);

	int sum1,sum2;

	sum1 = x-a;

	sum2 = x-b;

	sum1 < 0 ? sum1 *= -1 : sum1;

	sum2 < 0 ? sum2 *= -1 : sum2;

	sum1 < sum2 ? printf("A\n") : printf("B\n");

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.294964904990986x):
#include <stdio.h>



int main()

{

    int x,a,b;

    scanf("%d%d%d", &x, &a, &b);

    int xa, xb;

    if(x>a){

        xa= x-a;

    }else (xa= a-x);

    if(x>b){

        xb= x-b;

    }else(xb=b-x);

    if(xa>xb){

        printf("B\n");

    }else printf("A\n");

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295146567089727x):
#include<stdio.h>

int main(){

	int x;

	int a;

	int b;

	scanf("%d %d %d", &x ,&a, &b);

	int r1satu;

	int r2dua;

	

	r1satu= x>=a? x-a : a-x;

	r2dua= x>=b? x-b : b-x;

	

	if(r1satu<r2dua){

		printf("A");

	}else{

		printf("B");

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295381385349886x):
#include <stdio.h>



int main(){

	

	int n, a, b;

	scanf("%d %d %d", &n, &a, &b);

	

	int a1 = a-n;

	int b1 = b-n;

	

	if(a1 < 0){

		a1*=-1;

	}

	if(b1 < 0){

		b1*=-1;

	}

	

	if(a1 < b1){

		printf("A");

	}

	else{

		printf("B");

	}

		

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295146567089727x):
#include <stdio.h>



int main(){

	

	int x, a, b;

	scanf("%d %d %d", &x, &a, &b);

	

	int r1, r2;

	

	r1 = x>=a? x-a : a-x;

	r2 = x>=b? x-b : b-x;

	

	if(r1<r2){

		printf("A");

	}else {

		printf("B");

	}

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.294942427466572x):
#include <stdio.h>



int main(){

    int x,a,b;

    scanf ("%d %d %d", &x, &a, &b);

    int ans1, ans2;

    

    if(x-a<0){

        ans1 = (x-a) * -1; //998

    } else if(x-a>=0){

        ans1 = x-a;

    }

    

    if(x-b<0){

        ans2 = (x-b) * -1; //999

    } else if(x-b>=0){

        ans2 = x-b;

    }



    if(ans1 < ans2){

        printf("A\n");

    } else {

        printf("B\n");

    }



}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295233732622915x):
#include<stdio.h>

int main(){

	int x;

	int A;

	int B;

	int result1;

	int result2;

	scanf("%d %d %d", &x, &A, &B);

	if(x < A){

		result1 = A - x;

	}else{

		result1 = x - A;

	}

	if(x < B){

		result2 = B - x;

	}else{

		result2 = x - B;

	}





	if(result1 < result2){

		printf("A");

	}else{

		printf("B");

	}

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295146567089727x):
#include <stdio.h>



int main(){



    int G, N, D;

    scanf("%d %d %d", &G, &N, &D);



    int R1, R2;



    R1 = G>=N? G-N : N-G;

    R2 = G>=D? G-D : D-G;



    if(R1<R2){

        printf("A");

    }else {

        printf("B");

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main()

{

	int x=0,A=0,B=0;

	cin >> x >> A>>B;

	if(abs(x-A)>abs(x-B)) 

	{

		cout<<"B";

	}else 

	{

		cout<<"A";

	}

	

	return 0;

 } 

// Faster C++ solution for the same problem (measured speedup: 5.295403866601297x):
#include <stdio.h>



int main() {

  int x,a,b;

  int jarak1,jarak2;

  scanf("%d %d %d",&x,&a,&b);

  jarak1 = x-a;

  jarak2 = x-b;

  if (jarak1<0){

  		jarak1 *= -1;

  }

  if (jarak2<0){

  		jarak2 *= -1;

  }

  if (jarak1<jarak2){

  		printf("A");

  }

  else{

  		printf("B");

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdlib>



using namespace std;



int main()

{

  int x, a, b;

  cin >> x >> a >> b;

  cout << (abs(x - a) < abs(x - b) ? 'A' : 'B') << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.280486772384659x):
#include <cstdio>

#include <cstdlib>



int main()

{

        int x, a, b;

        scanf("%d%d%d", &x, &a, &b);



        int dstA = abs(x - a), dstB = abs(x - b);

        char ans = dstA < dstB ? 'A' : 'B';

        printf("%c\n", ans);

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.321381874278458x):
#include <stdio.h>



int main() {

	int pos,a,b;

	scanf("%d %d %d", &pos, &a, &b);

	int disa, disb;

	if(pos > a){

		disa = pos - a;

	}else{

		disa = a - pos;

	}

	if(pos > b){

		disb = pos - b;

	}else{

		disb = b - pos;

	}

	if(disa > disb){

		puts("B");

	}else{

		puts("A");

	}

	

	

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.3098265181100155x):
#include <stdio.h>



int main() {

	int pos,a,b;

	scanf("%d %d %d", &pos, &a, &b);

	int disa, disb;

	if(pos > a){

		disa = pos - a;

	}else{

		disa = a - pos;

	}

	if(pos > b){

		disb = pos - b;

	}else{

		disb = b - pos;

	}

	if(disa > disb){

		puts("B");

	}else{

		puts("A");

	}

	

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.308814110538645x):
#include<stdio.h>

int main(){

    

    int x, a, b;

    int diffa, diffb;

    scanf("%d%d%d", &x, &a, &b);

    diffa = x-a;

    if(diffa<0){

    	diffa *= -1;

	}

    diffb = x-b;

    if(diffb<0){

    	diffb *= -1;

	}

    if(diffa>diffb){

    	printf("B");

	} else {

		printf("A");

	}

    

    

    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.2972860452111314x):
#include<stdio.h>

int main(){

    

    int x, a, b;

    int diffa, diffb;

    scanf("%d%d%d", &x, &a, &b);

    diffa = x-a;

    if(diffa<0){

    	diffa *= -1;

	}

    diffb = x-b;

    if(diffb<0){

    	diffb *= -1;

	}

    if(diffa>diffb){

    	printf("B");

	} else {

		printf("A");

	}

    

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.30968596212584x):
#include <stdio.h>



int main(){

	int x,a,b;

	scanf("%d %d %d",&x,&a,&b);

	int dis_a=x-a;

	int dis_b=x-b;

	if(dis_a<0){

		dis_a*=-1;

	}

	if(dis_b<0){

		dis_b*=-1;

	}

	if(dis_a>dis_b){

		printf("B");

	}

	else if (dis_a<dis_b){

		printf("A");

	}

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.298156003576631x):
#include <stdio.h>



int main(){

	int x,a,b;

	scanf("%d %d %d",&x,&a,&b);

	int dis_a=x-a;

	int dis_b=x-b;

	if(dis_a<0){

		dis_a*=-1;

	}

	if(dis_b<0){

		dis_b*=-1;

	}

	if(dis_a>dis_b){

		printf("B");

	}

	else if (dis_a<dis_b){

		printf("A");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.308396649383417x):
#include<stdio.h>



int main()

{

	int x, n, m;

	

	scanf("%d %d %d", &x, &n, &m);

	

	int sum1 = n - x;

	int sum2 = m - x;

	

	if(sum1 < 0){

		sum1 *= -1;

	}

	if(sum2 < 0){

		sum2 *= -1;

	}

	

	if(sum1 < sum2){

		printf("A\n");

	}else{

		printf("B\n");

	}



}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.2968694905708755x):
#include<stdio.h>



int main()

{

	int x, n, m;

	

	scanf("%d %d %d", &x, &n, &m);

	

	int sum1 = n - x;

	int sum2 = m - x;

	

	if(sum1 < 0){

		sum1 *= -1;

	}

	if(sum2 < 0){

		sum2 *= -1;

	}

	

	if(sum1 < sum2){

		printf("A\n");

	}else{

		printf("B\n");

	}



}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307262645561135x):
#include <stdio.h>



int main() {

	int x, a, b;

	scanf ("%d%d%d", &x, &a, &b);

	int xa, xb;

	

	if (x > a) {

		xa = x - a;

	}

	else if (x < a) {

		xa = a - x;

	}

	

	if (x > b) {

		xb = x - b;

	}

	else if (x < b) {

		xb = b - x;

	}

	

	if (xa > xb) {

		printf ("B\n");

	}

	else {

		printf ("A\n");

	}

	return 0;	

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.295737949232657x):
#include <stdio.h>



int main() {

	int x, a, b;

	scanf ("%d%d%d", &x, &a, &b);

	int xa, xb;

	

	if (x > a) {

		xa = x - a;

	}

	else if (x < a) {

		xa = a - x;

	}

	

	if (x > b) {

		xb = x - b;

	}

	else if (x < b) {

		xb = b - x;

	}

	

	if (xa > xb) {

		printf ("B\n");

	}

	else {

		printf ("A\n");

	}

	return 0;	

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.308518216862219x):
#include <stdio.h>



int main(){

	int x, a, b;

	scanf("%d%d%d", &x, &a, &b);

	

	int lineA;

	

	if ( a < x){

		lineA = x -a;

     }

     	

	else if (a > x){

		lineA= a - x;

	}

	

	int lineB;

	

	if ( b < x){

		lineB = x - b;

     }

     	

	else if (b > x){

		lineB= b - x;

	}

	

	if (lineA < lineB){

		printf("A\n");

	}

	else if (lineB < lineA){

		printf("B\n");

	}

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.296990794066457x):
#include <stdio.h>



int main(){

	int x, a, b;

	scanf("%d%d%d", &x, &a, &b);

	

	int lineA;

	

	if ( a < x){

		lineA = x -a;

     }

     	

	else if (a > x){

		lineA= a - x;

	}

	

	int lineB;

	

	if ( b < x){

		lineB = x - b;

     }

     	

	else if (b > x){

		lineB= b - x;

	}

	

	if (lineA < lineB){

		printf("A\n");

	}

	else if (lineB < lineA){

		printf("B\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.30832130486958x):
#include<stdio.h>

int main(){

    int a, b, c;

    scanf("%d %d %d", &a, &b, &c);

    int distance_1 = b - a;

    int distance_2 = c - a;

    if(distance_1 < 0){

        distance_1 = distance_1 * -1;

    }

    if(distance_2 < 0){

        distance_2 = distance_2 * -1;

    }

    if(distance_2 < distance_1){

        printf("B\n");

    }

    else{

        printf("A\n");

    }

    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.296794309667301x):
#include<stdio.h>

int main(){

    int a, b, c;

    scanf("%d %d %d", &a, &b, &c);

    int distance_1 = b - a;

    int distance_2 = c - a;

    if(distance_1 < 0){

        distance_1 = distance_1 * -1;

    }

    if(distance_2 < 0){

        distance_2 = distance_2 * -1;

    }

    if(distance_2 < distance_1){

        printf("B\n");

    }

    else{

        printf("A\n");

    }

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.308910244754162x):
#include <stdio.h>



int main() {

	

	int x, A, B, sum1, sum2;

	scanf("%d %d %d", &x, &A, &B);

	sum1 = x - A;

	sum2 = x - B;

	

	if(sum1 < 0){

		sum1 *= -1;

	}

	else{

		sum1 *= 1;

	}

	

	if(sum2 < 0){

		sum2 *= -1;

	}

	else{

		sum2 *= 1;

	}

	

	if(sum1 > sum2){

		printf("B");	

	}

	else{

		printf("A");

	}

	

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.297381970671644x):
#include <stdio.h>



int main() {

	

	int x, A, B, sum1, sum2;

	scanf("%d %d %d", &x, &A, &B);

	sum1 = x - A;

	sum2 = x - B;

	

	if(sum1 < 0){

		sum1 *= -1;

	}

	else{

		sum1 *= 1;

	}

	

	if(sum2 < 0){

		sum2 *= -1;

	}

	else{

		sum2 *= 1;

	}

	

	if(sum1 > sum2){

		printf("B");	

	}

	else{

		printf("A");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.308361774495164x):
#include <stdio.h>



int main(){

	int him, A, B;

	scanf("%d %d %d", &him, &A, &B);

	int jwb1, jwb2;

	

	if(him - A < 0){

		jwb1 = (him - A) * -1;

	}else if(him - A >= 0){

		jwb1 = him - A;

	}

	

	if(him - B < 0){

		jwb2 = (him - B) * -1;

	}else if (him - B >= 0){

		jwb2 = him - B;

	}

	

	if(jwb1 < jwb2){

		printf("A\n");

	} else {

		printf("B\n");

	}

	return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.29683469141328x):
#include <stdio.h>



int main(){

	int him, A, B;

	scanf("%d %d %d", &him, &A, &B);

	int jwb1, jwb2;

	

	if(him - A < 0){

		jwb1 = (him - A) * -1;

	}else if(him - A >= 0){

		jwb1 = him - A;

	}

	

	if(him - B < 0){

		jwb2 = (him - B) * -1;

	}else if (him - B >= 0){

		jwb2 = him - B;

	}

	

	if(jwb1 < jwb2){

		printf("A\n");

	} else {

		printf("B\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int x, a, b;

    cin >> x >> a >> b;



    if (abs(x - a) > abs(x - b))

        cout << "B" << endl;

    else cout << "A" << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3088243830877175x):
#include <stdio.h>



int main() {

    int aaa, bb, cc;

    scanf("%d %d %d", &aaa, &bb, &cc);

   int i = aaa-bb;

   int j = aaa-cc;

 

   

    if(i<0){

        i = -i;

    }

    if(j<0){

        j = -j;

    }

    

    if(i == -i){

        i *= -1;

    }

   if(j == -j){

       j *= -1;

   }

    if(i < j){

        printf("A");

    }

    else{

        printf("B");

    }



    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<iostream>

#include<math.h>

#include<stdlib.h>

using namespace std;





int main(){

    int a,b,x;

    cin>>x>>a>>b;

    a=abs(x-a);

    b=abs(x-b);

    if(a<b){

        cout<<"A";

    }

    else{

        cout<<"B";

    }



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.297296295453411x):
#include <stdio.h>



int main() {

    int aaa, bb, cc;

    scanf("%d %d %d", &aaa, &bb, &cc);

   int i = aaa-bb;

   int j = aaa-cc;

 

   

    if(i<0){

        i = -i;

    }

    if(j<0){

        j = -j;

    }

    

    if(i == -i){

        i *= -1;

    }

   if(j == -j){

       j *= -1;

   }

    if(i < j){

        printf("A");

    }

    else{

        printf("B");

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cmath>

using namespace  std;



int main()

{

    int x,y,z;

    while(cin>>x>>y>>z)

    {

        if(abs(y-x)>=abs(z-x))

        {

            cout<<"B"<<endl;

        }

        else cout<<"A"<<endl;

    }

}


// Faster C++ solution for the same problem (measured speedup: 5.311642353464151x):
#include <stdio.h>

int main(void){

	int x,a,b,m,n;

	scanf("%d %d %d",&x,&a,&b);

	if(x>=a){

		m=x-a;

	}

	else{

		m=a-x;

	}

	if(x>=b){

		n=x-b;

	}

	else{

		n=b-x;

	}

	if(m>n){

		printf("B");

	}

	else{

		printf("A");

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cmath>

using namespace  std;



int main()

{

    int x,y,z;

    while(cin>>x>>y>>z)

    {

        if(abs(y-x)>=abs(z-x))

        {

            cout<<"B"<<endl;

        }

        else cout<<"A"<<endl;

    }

}


// Faster C++ solution for the same problem (measured speedup: 5.309193716887553x):
#include <stdio.h>



int abs(int n){

	if(n<0){

		n*=(-1);

	}

	return n;

}



int main (){

    int x, a, b;

    scanf ("%d %d %d", &x, &a, &b);

    if(abs(x-a)<abs(x-b)){

    	printf("A\n");

	}else{

		printf("B\n");

	}

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cmath>

using namespace  std;



int main()

{

    int x,y,z;

    while(cin>>x>>y>>z)

    {

        if(abs(y-x)>=abs(z-x))

        {

            cout<<"B"<<endl;

        }

        else cout<<"A"<<endl;

    }

}


// Faster C++ solution for the same problem (measured speedup: 5.3129290241882074x):
//i

#include <stdio.h>



int main(){

	int x, a, b;

	scanf ("%d %d %d", &x, &a, &b);

	

	int selisihA = a-x;

	

	if (selisihA<0)

	{

		selisihA = selisihA*-1;

	}

	

	int selisihB = b-x;

	

	if (selisihB<0)

	{

		selisihB= selisihB*-1;

	}



	

	if (selisihA<selisihB)

	{

		printf ("A");

	}

	

	else if (selisihB<selisihA)

	{

		printf ("B");

	}

	

	

	return 0;

}