#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 3e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;
 
//vector<ll> G[550010];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
// priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
 
 
//ll mod = 998244353;
ll mod = 1000000007;
 
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
 
ll n,m,num,sum,a,b,c,d,e,g,h,w, i,j,q,r,l;
ll k;
ll ans;
ll x[500005], y[200005], z[200005];
// char s[500005], t[500005];
bool pittari[5005][5005];
ll dp[3004][3004];
char s[2005][2005];

ll ruiseki(ll i, ll j){
    return y[r] - y[l];
}
bool solve_l(ll i,ll j){
    // [i, j]が左から見てぴったりかどうかを返す
    ll l = i, r = j;
    ll sum = 0;
    bool pittari = true;
    for(ll i=l;i<=r;i++){
        sum += x[i];
        if(sum <= k){
            pittari = false;
        }else{
            pittari = true;
        }
    }
    return pittari;
}

bool solve_r(ll i,ll j){
    ll l = i, r = j;
    ll sum = 0;
    bool pittari = true;
    for(ll i=r;i>=l;i--){
        sum += x[i];
        if(sum <= k){
            pittari = false;
        }else{
            pittari = true;
        }
    }
    return pittari;
}

int main(){
    /*
    cin.tie(0);
    ios::sync_with_stdio(false);
    */
    cin >> n >> k;
    for(ll i=0;i<n;i++){
        cin >> x[i];
    }
    for(ll i=0;i<n;i++){
        y[i+1] = x[i];
    }
    for(ll i=0;i<n;i++){
        y[i+2] += y[i+1];
    }
    bool canwin = false;
    if(n == 1){
        p("B");
        return 0;
    }
    for(ll i=0;i<n;i++){
        if(i == 0){
            if(!solve_r(1, n-1))canwin = true;
        }else if(i == n - 1){
            if(!solve_l(0, n-2))canwin = true;
        }else{
            if(!solve_l(0, i-1) || !solve_r(i+1, n-1))canwin = true;
        }
    }

    if(canwin){
        p("A");
    }else{
        p("B");
    }
    return 0;
}