#include <bits/stdc++.h>
using namespace std;
const int N = 3e5;
int ID[9][9][9][9], t0t;
int bk[500][5], num[500][500], cnt, zt[N], deg[N];
vector<int> G[N], iG[N];
queue<int> q;
bool vis[N];
void addedge(int u, int v) {
  G[u].push_back(v), iG[v].push_back(u);
  ++deg[u];
}
void init() {
  for (int _0 = (0); _0 <= (8); ++_0)
    for (int _1 = (0); _1 <= (8 - _0); ++_1)
      for (int _2 = (0); _2 <= (8 - _0 - _1); ++_2)
        for (int _3 = (0); _3 <= (8 - _0 - _1 - _2); ++_3) {
          ID[_0][_1][_2][_3] = ++t0t;
          bk[t0t][0] = _0;
          bk[t0t][1] = _1;
          bk[t0t][2] = _2;
          bk[t0t][3] = _3;
          bk[t0t][4] = 8 - _0 - _1 - _2 - _3;
        }
  for (int i = 1; i <= t0t; ++i)
    for (int j = 1; j <= t0t; ++j) num[i][j] = ++cnt;
  int zero = ID[8][0][0][0];
  for (int i = 1; i <= t0t; ++i)
    if (i != zero) {
      zt[num[zero][i]] = 1, zt[num[i][zero]] = 2;
      vis[num[zero][i]] = vis[num[i][zero]] = 1;
      q.push(num[i][zero]), q.push(num[zero][i]);
    }
  for (int x = (1); x <= (t0t); ++x)
    for (int y = (1); y <= (t0t); ++y)
      if (x != zero && y != zero) {
        int s[5] = {bk[x][0], bk[x][1], bk[x][2], bk[x][3], bk[x][4]};
        for (int a = (1); a <= (4); ++a)
          for (int b = (1); b <= (4); ++b)
            if (s[a] && bk[y][b]) {
              --s[a], ++s[(a + b) % 5];
              int nzt = ID[s[0]][s[1]][s[2]][s[3]];
              ++s[a], --s[(a + b) % 5];
              addedge(num[x][y], num[y][nzt]);
            }
      }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int to : iG[u])
      if (zt[u] == 2 && !vis[to]) {
        vis[to] = 1;
        zt[to] = 1;
        q.push(to);
      } else if (!--deg[to] && !vis[to]) {
        vis[to] = 1;
        zt[to] = 2;
        q.push(to);
      }
  }
}
int main() {
  init();
  int T;
  for (scanf("%d", &T); T--;) {
    int fst;
    int a[5] = {0}, b[5] = {0};
    scanf("%d", &fst);
    for (int i = 0, x; i < 8; ++i) scanf("%d", &x), ++a[x];
    for (int i = 0, x; i < 8; ++i) scanf("%d", &x), ++b[x];
    if (fst)
      for (int i = 0; i < 5; ++i) swap(a[i], b[i]);
    int z = zt[num[ID[a[0]][a[1]][a[2]][a[3]]][ID[b[0]][b[1]][b[2]][b[3]]]];
    if (z == 0)
      puts("Deal");
    else {
      if (fst) z = 3 - z;
      if (z == 1)
        puts("Alice");
      else
        puts("Bob");
    }
  }
  return 0;
}
