#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))
//-------------------------------------------------------

int N;
ll X,A[5050];
int memo[5050][5050];
int RR[5050];
int LL[5050];

int win(int L,int R) {
	if(L==R) return 1;
	if(memo[L][R]==-1) {
		memo[L][R]=0;
		int x;
		for(x=L+1;x<=RR[L];x++) if(win(x,R)==0) memo[L][R]=1;
		for(x=R-1;x>=LL[R];x--) if(win(L,x)==0) memo[L][R]=1;
	}
	return memo[L][R];
	
}

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) {
		LL[i]=RR[i]=i;
		ll sum=0;
		for(j=i;j<N;j++) {
			sum+=A[j];
			if(sum<=X) RR[i]=j+1;
		}
		sum=0;
		
		for(j=i;j>=1;j--) {
			sum+=A[j-1];
			if(sum<=X) LL[i]=j-1;
		}
	}
	
	MINUS(memo);
	if(win(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;
}