#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const int mod = (int)1e9 + 7;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b){
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b){
    return a > b ? b : a;
}

const int N = (int)2e5 + 1, M = N * 2;

void solve(){
    int n;
    string s;
    cin >> n >> s;

    int a[n];
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    int b = 0, owo = 0;
    for(int i = 0; i < n; i++){
        if(a[i] != i + 1){
            b++;
        }
    }

    if(s == "Bob"){
        for(int i = 1; i < n; i++){
            int qwq = b;
            if(a[i] != i + 1){
                qwq--;
            }
            if(a[i - 1] != i){
                qwq--;
            }
            swap(a[i], a[i - 1]);
            if(a[i] != i + 1){
                qwq++;
            }
            if(a[i - 1] != i){
                qwq++;
            }
            swap(a[i], a[i - 1]);
            owo = chmax(qwq, owo);
        }
    }

    if(owo > 2){
        cout << "Bob" << endl;
    }
    else{
        cout << "Alice" << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    cin >> t;

    while(t--){
        solve();    
    }
    return 0;
}