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

#define int long long  

void solve() {
	int n, k;
	cin >> n >> k;

	vector<int> a(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a.begin() + 1, a.end());
	// for (int i = 1; i <= n; i++) {
	// 	cout << a[i] << " \n"[i == n];
	// }

	vector<pair<int, int>> v;
	int now = 1;
	while (now <= n) {
		auto check = [&](int x) {
			return (a[x] - a[now] == x - now);
		};
		int l = now - 1, r = n + 1;
		while (l + 1 != r) {
			int mid = (l + r) / 2;
			if (check(mid)) {
				l = mid;
			} else {
				r = mid;
			}
		}
		v.push_back({a[now], a[l]});
		now = l + 1;
	}

	vector<pair<int, int>> t;
	if (v[0].first != 0) {
		t.emplace_back(0, v[0].first - 1);
	}
	for (int i = 1; i < v.size(); i++) {
		t.emplace_back(v[i - 1].second + 1, v[i].first - 1);
	}

	t.emplace_back(v.back().second + 1, 1e18);

	int s = 2 * k;
	for (auto [l, r] : t) {
		int len = r - l + 1;
		if (s >= len) {
			s -= len;
		} else {
			if (l % 2) {
				if (s % 2) {
					cout << "Alice\n";
				} else {
					cout << "Bob\n";
				}
				return;
			} else {
				if (s % 2 == 0) {
					cout << "Alice\n";
				} else {
					cout << "Bob\n";
				}
				return;
			}
		}
	}
}

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

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}