#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100001],f[100001],n;
inline int lowbit(int x){return x&-x;}
inline void add(int x){
	while(x<=n){
		f[x]++;
		x+=lowbit(x);
	}
}
inline int query(int x){
	int sum=0;
	while(x!=0){
		sum+=f[x];
		x-=lowbit(x);
	}
	return sum;
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
		scanf("%d",&n);string s;cin>>s;
		for(register int i=1;i<=n;++i){
		    scanf("%d",&a[i]);
		    f[i]=0;
		}
		int ans=0;
		for(register int i=1;i<=n;++i){
			add(a[i]);
			ans+=i-query(a[i]);
		}
		if(ans%2==1)cout<<s<<endl;
		else if(s[0]=='A')cout<<"Bob\n";
		else cout<<"Alice\n";
	}
	return 0;
}