#include <bits/stdc++.h>
using namespace std;
int f[6005][6005], deg[6005][6005];
struct p {
  int x, y;
} u;
queue<p> q;
void pre() {
  for (int i = 0; i <= 8; i++)
    for (int ii = 0; i + ii <= 8; ii++)
      for (int iii = 0; i + ii + iii <= 8; iii++)
        for (int iv = 0; i + ii + iii + iv <= 8; iv++) {
          int nw = i + ii * 9 + iii * 81 + iv * 729;
          if (!nw) continue;
          f[nw][0] = -1;
          q.push((p){nw, 0});
          for (int j = 0; j <= 8; j++)
            for (int jj = 0; j + jj <= 8; jj++)
              for (int jjj = 0; j + jj + jjj <= 8; jjj++)
                for (int jv = 0; j + jj + jjj + jv <= 8; jv++) {
                  int nt = j + jj * 9 + jjj * 81 + jv * 729;
                  if (!nt) continue;
                  deg[nw][nt] =
                      (!!i + !!ii + !!iii + !!iv) * (!!j + !!jj + !!jjj + !!jv);
                }
        }
  while (!q.empty()) {
    u = q.front();
    q.pop();
    int a[5], b[5], x, y;
    x = u.x;
    y = u.y;
    for (int i = 1; i <= 4; i++) a[i] = y % 9, y /= 9;
    a[0] = 8 - a[1] - a[2] - a[3] - a[4];
    for (int i = 1; i <= 4; i++) b[i] = x % 9, x /= 9;
    b[0] = 8 - b[1] - b[2] - b[3] - b[4];
    for (int i = 0; i <= 4; i++)
      if (a[i])
        for (int j = 1; j <= 4; j++)
          if (b[j] && i != j) {
            a[i]--;
            a[(i - j + 5) % 5]++;
            x = a[1] + a[2] * 9 + a[3] * 81 + a[4] * 729;
            y = b[1] + b[2] * 9 + b[3] * 81 + b[4] * 729;
            if (f[u.x][u.y] == 1) {
              deg[x][y]--;
              if (!deg[x][y]) {
                f[x][y] = -1;
                q.push((p){x, y});
              }
            } else if (!f[x][y])
              f[x][y] = 1, q.push((p){x, y});
            a[i]++;
            a[(i - j + 5) % 5]--;
          }
  }
}
int in() {
  int a[5], x;
  memset(a, 0, sizeof(a));
  for (int i = 0; i < 8; i++) scanf("%d", &x), a[x]++;
  return a[1] * 1 + a[2] * 9 + a[3] * 81 + a[4] * 729;
}
int main() {
  pre();
  int tt, x, y, t, ff, res;
  scanf("%d", &tt);
  while (tt--) {
    scanf("%d", &ff);
    x = in();
    y = in();
    res = ff ? -f[y][x] : f[x][y];
    if (res == 1)
      puts("Alice");
    else if (res == 0)
      puts("Deal");
    else if (res == -1)
      puts("Bob");
  }
  return 0;
}
