#include<bits/stdc++.h>
// #include<iostream>
using namespace std;

using ll = long long;
template <class T>
struct BIT {
    int n;
    vector<T> s;
    BIT(int n): n(n), s(n + 1) {

    }
    void add(int i, const T &v) {
        for(i++; i <= n; i += i & -i) {
            s[i] += v;
        }
    }
    T sum(int i) {
        T ans{};
        for(; i; i -= i & -i) {
            ans += s[i];
        }
        return ans;
    }
    T sum(int l, int r) {
        return sum(r) - sum(l);
    }
};
void solve() {
    int n; string st;
    cin >> n >> st;
    
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    if(n == 2){
        cout << "Alice\n";
        return;
    }
    BIT<int> bit(n + 5);
    ll inv = 0;
    for(int i = 0; i < n; i++){
        inv += bit.sum(a[i] + 1, n + 1);
        bit.add(a[i], 1);
    }
    if(st == "Bob" && inv & 1) {
        cout << "Bob\n";
        return;
    }
    if(st == "Alice" && inv % 2 == 0){
        cout << "Bob\n";
        return;
    }
    cout << "Alice\n";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
}