from collections import deque

n, m = map(int, input().split())
ginv = [[] for _ in range(n)]
l = [0] * n
for _ in range(m):
    _u, _v = map(lambda x: int(x) - 1, input().split())
    ginv[_v].append(_u)
    l[_u] += 1

det = [0] * n
Q = deque([])
for v, x in enumerate(l):
    if x == 0:
        det[v] = -1
        for u in ginv[v]:
            Q.append(u)

if not Q:
    print("Draw")
    quit()
if det[0] == -1:
    print("Bob")
    quit()

while Q:
    v = Q.popleft()
    if det[v] == 1:
        continue
    det[v] = 1
    if v == 0:
        print("Alice")
        quit()
    for u in ginv[v]:
        if det[u] == 0:
            det[u] = -l[u]
        elif det[u] < -1:
            det[u] += 1
        if det[u] == -1:
            if u == 0:
                print("Bob")
                quit()
            for w in ginv[u]:
                Q.append(w)

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