#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define SZ(x) ((int)(x).size())
#define debug(a) cout<<#a<<":"<<a<<endl
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
constexpr int N=100010;
constexpr int INF=2e9;
constexpr ll LLF=2e18;
constexpr ll mod=998244353;
constexpr int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
ll powmod(ll a,ll b,ll mod=mod) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll inv(ll a){return powmod(a,mod-2);}
int n,a[N];
string s;
void solve() {
	cin>>n>>s;
	int cnt=0; 	
	rep(i,1,n){
		cin>>a[i];
		if(a[i]!=i){
			cnt++;
		}
	}
	if(n==2){
		cout<<"Alice\n";
		return;
	}
	if(s=="Alice"){
		if(cnt<=2){
			cout<<"Alice\n";
		}else{
			cout<<"Bob\n";
		}
	}else{
		if(cnt==0){
			cout<<"Alice\n";
		}else{
			cout<<"Bob\n";
		}
	}
}
int main() {
	ios::sync_with_stdio(false);cin.tie(nullptr);
	//cout<<fixed<<setprecision(10);
	int testcase;cin>>testcase;rep(_,1,testcase){
		solve();
	}
	return 0;	
}