#include <bits/stdc++.h>
using namespace std;
#define _rep(i_,a_,b_) for(int i_ = (a_); i_ <= (b_); ++i_)
#define mid ((L+R) >> 1)
#define multiCase() int testCnt = in(); _rep(curCase,1,testCnt)
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
using ll = long long;
using pii = pair<int,int>;

int in(void) { int x; scanf("%d", &x); return x; } ll inl(void) { ll x; scanf("%lld", &x); return x; }
void out(int x) { printf("%d ", x); } void outln(int x) { printf("%d\n", x); }
void out(ll x) { printf("%lld ", x); } void outln(ll x) { printf("%lld\n", x); }
template<typename T> void chkmax(T &a, const T &b) { a = max(a, b); } 
template<typename T> void chkmin(T &a, const T &b) { a = min(a, b); } 
char player[15];

map<pair<vector<int>, int>, int> mem;
set<pair<vector<int>, int>> stk;
bool judge(vector<int> state, int cur) { int op = cur ^ 1;
	debug("J %d %d %d %d\n", state[0], state[1], state[2], cur);
	if(is_sorted(state.begin(), state.end())) return 0;
	if(mem.count(pair(state, cur))) return mem[pair(state, cur)];
	stk.insert(pair(state, cur));
	if(cur == 0) {
		for(auto &a : state) for(auto &b : state) if(a != b) {
			swap(a, b); 
			if(stk.count(pair(state, op))) {
			} else {
				if(judge(state, op) == cur) {
				swap(a, b);
	stk.erase(pair(state, cur));
				return cur;
				}
			}
			swap(a, b);
		}
	} else {
		_rep(i,0,state.size() - 2) {
			swap(state[i], state[i + 1]); 
			if(stk.count(pair(state, op))) {
				if(cur == 1) {

			swap(state[i], state[i + 1]);
	stk.erase(pair(state, cur));
				return cur;
				}
			} else {
				if(judge(state, op) == cur) {
					debug("i = %d\n", i);
			swap(state[i], state[i + 1]);
			stk.erase(pair(state, cur));
					return cur;
				}
			}
			swap(state[i], state[i + 1]);
		}
	}
	stk.erase(pair(state, cur));
	return op;
}

int main() {
	multiCase() {
		int n = in(); scanf("%s", player);
		vector<int> a(n); for(auto &v : a) v = in();
		if(n <= 5) {
			int op = player[0] == 'A' ? 0 : 1;
			stk.clear();
			int res = (mem[pair(a, op)] = judge(a, op));
			puts(res == 0 ? "Alice" : "Bob");
		} else {
			int cnt = 0;
			_rep(i,0,n - 1) if(a[i] != i + 1) ++cnt;
			if(is_sorted(a.begin(), a.end())) puts("Alice");
			else if(player[0] == 'A' && cnt == 2) puts("Alice");
			else puts("Bob");
		}
	}
	return 0;
}