#include "bits/stdc++.h"

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1ll << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>

struct BIT {
    vector<ll> dat;
    ll sz;
    BIT(ll n) {
        sz = n;
        dat.resize(sz);
    }
    void add(int x, ll a){
        for(ll i = x; i <= sz; i += i & -i)dat[i] += a;
    }
    ll sum(int x){
        ll res = 0;
        for(int i = x; i > 0; i -= i & -i) res += dat[i];
        return res;
    }

};

string solve(ll n, string s){
    BIT bit(n + 5);
    ll te = 0;
    REP(i, n){
        ll x;
        cin >> x;
        te += i - bit.sum(x);
        bit.add(x, 1);
    }
    if(n == 2)return "Alice";
    if((te % 2 == 1 and s == "Alice") or (te % 2 == 0  and s == "Bob"))return "Alice";
    return "Bob";
}
int main() {
    ll t;
    cin >> t;
    REP(i, t){
        ll n;
        string s;
        cin >> n >> s;
        cout << solve(n, s) << endl;
    }
}