n, m = map(int, input().split())
g = [[] for i in range(n)]
deg = [0] * n
for _ in range(m):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    g[v].append(u)
    deg[u] += 1

# -1 負け 1 勝ち 0 引き分け
dp = [0] * n
q = []
for i in range(n):
    if deg[i] == 0:
        q.append(i)
# 遷移先に負けがあったら勝

while q:
    x = q.pop()
    if dp[x] == 0:
        dp[x] = -1
    # print(x)
    for y in g[x]:
        deg[y] -= 1
        dp[y] = max(dp[y], -dp[x])
        if deg[y] == 0:
            q.append(y)

# print(dp)
if dp[0] == 1:
    print("Alice")
elif dp[0] == 0:
    print("Draw")
else:
    print("Bob")