#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define in insert
int n, k;

void solve()
{
  set<int> a;
  cin >> n >> k;
  for(int i = 1; i <= n; ++i)
  {
    int x;
    cin >> x;
    a.in(x);
  }
  int pre = -1;
  int ans = -1;
  for(auto u : a)
  {
    if(u != pre+1)
    {
      ans = pre+1;
      break;
    }
    else
    {
      pre++;
    }
  }
  int la = 0, lb = 0;
  int prea, preb;
  if(ans & 1)
  {
    prea = ans-1;
    preb = ans;
  }
  else
  {
    prea = ans;
    preb = ans-1;
  }

  while(k--)
  {
    la++; lb++;
    int nxta = prea+2;
    int nxtb = preb+2;
    while(a.lower_bound(nxta) != a.end())nxta += 2, la++;
    while(a.lower_bound(nxtb) != a.end())nxtb += 2, lb++;
    prea = nxta;
    preb = nxtb;
  }
  if(ans % 2 == 0)
  {
    if(lb >= la)
    {
      cout << "Bob" << '\n';
      return;
    }
    else
    {
      cout << "Alice" << '\n';
      return;
    }
  }
  else
  {
    if(la >= lb)
    {
      cout << "Alice" << '\n';
      return;
    }
    else
    {
      cout << "Bob" << '\n';
      return;
    }
  }

}


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