#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

template <typename T>
struct SegmentTree{
  using F = function<T(T,T)>;
  int n;
  F f;//二項演算
  T ti;//単位元
  vector<T> dat;

  SegmentTree(){}
  SegmentTree(F f,T ti):f(f),ti(ti){}

  void init(int n_){//sizeがn_のsegtreeを作る
    n=1;
    while(n<n_) n<<=1;
    dat.assign(n<<1,ti);
  }

  void build(const vector<T> &v){//vによってsegtreeをbuildする
    int n_=v.size();
    init(n_);
    for(int i=0;i<n_;i++) dat[n+i]=v[i];
    for(int i=n-1;i;i--)
      dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
  }

  void set_val(int k,T x){//k番目をxにする
    dat[k+=n]=x;
    while(k>>=1)
      dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);
  }

  T query(int a,int b){//区間[a,b)に対しFを適応した値を返す
    if(a>=b) return ti;
    T vl=ti,vr=ti;
    for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {
      if(l&1) vl=f(vl,dat[l++]);
      if(r&1) vr=f(dat[--r],vr);
    }
    return f(vl,vr);
  }

  template<typename C>
  int find(int st,C &check,T &acc,int k,int l,int r){//
    if(l+1==r){
      acc=f(acc,dat[k]);
      return check(acc)?k-n:-1;
    }
    int m=(l+r)>>1;
    if(m<=st) return find(st,check,acc,(k<<1)|1,m,r);
    if(st<=l&&!check(f(acc,dat[k]))){
      acc=f(acc,dat[k]);
      return -1;
    }
    int vl=find(st,check,acc,(k<<1)|0,l,m);
    if(~vl) return vl;
    return find(st,check,acc,(k<<1)|1,m,r);
  }

  template<typename C>
  int find(int st,C &check){
    T acc=ti;
    return find(st,check,acc,1,0,n);
  }

  T &operator [] (int i) {return dat[i+n];};
};


int n;ll x;
ll a[5010];
//int dp[5010][5010];
int max1[5010],max2[5010];


void solve(){
  cin >> n >> x;
  rep(i,n){
    cin >> a[i+1];
  }
  
  a[0]=INF;
  a[n+1]=INF;
  auto f=[](bool p,bool q){return p&q;};
  vector<SegmentTree<bool>> seg1(n+2,SegmentTree<bool>(f,1));
  vector<SegmentTree<bool>> seg2(n+2,SegmentTree<bool>(f,1));
  rep(i,n+2){
    seg1[i].init(n+2);
  }
  rep(i,n+2){
    seg2[i].init(n+2);
  }
  int j=1;ll S=a[1];
  Rep(i,1,n+1){
    while(S+a[j+1]<=x){
      j+=1;
      S+=a[j];
    }
    max1[i]=j;
    S-=a[i];
  }
  j=n;S=a[n];
  Per(i,1,n+1){
    while(S+a[j-1]<=x){
      j-=1;
      S+=a[j];
    }
    max2[i]=j;
    S-=a[i];
  }
  // rep(i,n){
  //   cout << max1[i+1] << " "; 
  // }
  // cout << "" << endl;
  // rep(i,n){
  //   cout << max2[i+1] << " "; 
  // }
  // cout << "" << endl;
  bool ans;
  Rep(d,1,n+2){
    rep(i,n+2-d){
      int j=i+d;
      int s=1;
      if(d==1){
        s=1;
      }
      else{
        //cout << seg1[j].query(i+1,min(max1[i+1]+1,j)) << endl;
        //cout << seg2[i].query(max(i+1,max2[j-1]),j) << endl;
        s&=(int)seg1[j].query(i+1,min(max1[i+1]+1,j));
        s&=(int)seg2[i].query(max(i+1,max2[j-1]),j);
        s^=1;
        //cout << s << endl;
      }
      if(i==0 && j==n+1) ans=s;
      //cout << i << " " << j << " " << s << endl;
      seg1[j].set_val(i,s);
      seg2[i].set_val(j,s);
    }
  }
  if(ans) cout << "A" << endl;
  else cout << "B" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}