#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define in insert
int n, k;
const int N = 1e6+5;
int vis[N];

void solve()
{
  set<int> st;
  cin >> n >> k;
  for(int i = 1; i <= n; ++i)
  {
    int x;
    cin >> x;
    st.in(x);
    vis[x] = 1;
  }
  int curk = k;
  for(int i = 1;; i += 2)
  {
    if(vis[i])continue;
    else
    {
      vis[i] = 1;
      k--;
      st.in(i);
      if(k == 0)
      {
        break;
      }
    }
  }
  for(int i = 0;; i += 2)
  {
    if(vis[i])continue;
    else
    {
      vis[i] = 1;
      curk--;
      st.in(i);
      if(curk == 0)
      {
        break;
      }
    }
  }
  int pr = -1;
  int ans = 0;
  for(auto u : st)
  {
    if(u != pr+1)
    {
      ans = pr + 1;
      break;
    }
    else pr++;
  }
  if(ans & 1)
  {
    cout << "Bob" << '\n';
  }
  else cout << "Alice" << '\n';
  for(auto u : st)
  {
    if(u & 1)vis[u] = 0;
    else vis[u] = 0;
  }

}


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