#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}

struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  int N, M;
  cin >> N >> M;
  vector<vi> G(N);
  vi d(N);
  rep(M) {
    int U, V;
    cin >> U >> V;
    --U, --V;
    G[V].push_back(U);
    d[U]++;
  }
  vi ans(N), ok(N);
  queue<int> bfs;
  rep(i, N) {
    if (d[i] == 0) {
      ans[i] = -1;
      ok[i] = 1;
      bfs.push(i);
    }
  }
  while (bfs.size()) {
    int v = bfs.front();
    bfs.pop();
    int t = -ans[v];
    for (int u : G[v]) {
      if (!ok[u]) {
        ok[u] = 1;
        ans[u] = t;
      }
      chmax(ans[u], t);
      if (ans[u] == 1) {
        bfs.push(u);
        d[u] = -1;
      }
      d[u]--;
      if (d[u] == 0)
        bfs.push(u);
    }
  }
  // fore(i,ans)cerr<<i<<' ';
  // cerr<<endl;
  vector<string> ret = {"Bob", "Draw", "Alice"};
  cout<<ret[ans[0]+1]<<'\n';
}