#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

template<class V, int ME> class BIT {
public:
	V bit[1<<ME];
	V operator()(int e) {if(e<0) return 0;V s=0;e++;while(e) s+=bit[e-1],e-=e&-e; return s;}
	void add(int e,V v) { e++; while(e<=1<<ME) bit[e-1]+=v,e+=e&-e;}
};
BIT<int,13> Rm[5050],Lm[5050];

int N;
ll X,A[5050];
int memo[5050][5050];
int R[5050];
int L[5050];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>X;
	FOR(i,N) cin>>A[i];
	
	FOR(i,N+1) {
		L[i]=R[i]=i;
		ll sum=0;
		for(j=i;j<N;j++) {
			sum+=A[j];
			if(sum<=X) R[i]=j+1;
		}
		sum=0;
		
		for(j=i;j>=1;j--) {
			sum+=A[j-1];
			if(sum<=X) L[i]=j-1;
		}
		Lm[i].add(i+1,1);
		Rm[i+1].add(i,1);
	}
	
	for(int len=2;len<=N;len++) {
		for(x=0;x+len<=N;x++) {
			y=Rm[x+len](R[x]);
			y+=Lm[x](x+len)-Lm[x](L[x+len]);
			memo[x][x+len]=y>0;
			if(y==0) {
				Lm[x].add(x+len,1);
				Rm[x+len].add(x,1);
			}
		}
	}
	
	if(memo[0][N]) cout<<"A"<<endl;
	else cout<<"B"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}