#include <bits/stdc++.h>
using namespace std;
const int maxn = 495;
const int p16[5] = {1, 9, 9 * 9, 9 * 9 * 9, 9 * 9 * 9 * 9};
int t, f, p, q, x, deg[maxn][maxn], res[maxn][maxn];
vector<vector<int> > vv;
vector<int> v;
vector<pair<int, int> > G[maxn][maxn];
queue<pair<int, int> > que;
map<int, int> mp;
void pr(int n, int k) {
  if (k == 1) {
    v.push_back(n);
    vv.push_back(v);
    v.pop_back();
    return;
  }
  for (int i = 0; i <= n; ++i) {
    v.push_back(i);
    pr(n - i, k - 1);
    v.pop_back();
  }
}
int main() {
  pr(8, 5);
  for (int i = 0; i < (int)vv.size(); ++i) {
    int now = 0;
    for (int j = 0; j < 5; ++j) now += p16[j] * vv[i][j];
    mp[now] = i;
  }
  for (int i = 0; i < (int)vv.size(); ++i) {
    int now = 0;
    for (int j = 0; j < 5; ++j) now += p16[j] * vv[i][j];
    for (int j = 0; j < (int)vv.size(); ++j) {
      bool ok = true, ok1 = true;
      for (int k = 1; k <= 4; ++k)
        if (vv[i][k]) {
          ok = false;
          for (int l = 1; l <= 4; ++l)
            if (vv[j][l]) {
              ok1 = false;
              now -= p16[k];
              now += p16[(k + l) % 5];
              G[j][mp[now]].push_back(pair<int, int>(i, j));
              ++deg[i][j];
              now += p16[k];
              now -= p16[(k + l) % 5];
            }
        }
      if (ok) {
        que.push(pair<int, int>(i, j));
        res[i][j] = 1;
      } else if (ok1) {
        que.push(pair<int, int>(i, j));
        res[i][j] = 2;
      }
    }
  }
  while (!que.empty()) {
    int p = que.front().first, q = que.front().second;
    que.pop();
    for (int i = 0; i < (int)G[p][q].size(); ++i) {
      int s = G[p][q][i].first, t = G[p][q][i].second;
      if (res[s][t]) continue;
      if (res[p][q] == 2) {
        que.push(pair<int, int>(s, t));
        res[s][t] = 1;
      } else {
        --deg[s][t];
        if (!deg[s][t]) {
          que.push(pair<int, int>(s, t));
          res[s][t] = 2;
        }
      }
    }
  }
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &f);
    p = q = 0;
    for (int i = 0; i < 8; ++i) {
      scanf("%d", &x);
      p += p16[x];
    }
    for (int i = 0; i < 8; ++i) {
      scanf("%d", &x);
      q += p16[x];
    }
    p = mp[p], q = mp[q];
    if (f == 0) {
      if (res[p][q] == 1)
        puts("Alice");
      else if (res[p][q] == 2)
        puts("Bob");
      else
        puts("Deal");
    } else {
      if (res[q][p] == 1)
        puts("Bob");
      else if (res[q][p] == 2)
        puts("Alice");
      else
        puts("Deal");
    }
  }
  return 0;
}
