Problem:


Score : 100 points

Problem Statement

Alice and Bob are playing One Card Poker.

One Card Poker is a two-player game using playing cards.  

Each card in this game shows an integer between 1 and 13, inclusive.

The strength of a card is determined by the number written on it, as follows:  

Weak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong  

One Card Poker is played as follows:  

Each player picks one card from the deck. The chosen card becomes the player's hand.

The players reveal their hands to each other. The player with the stronger card wins the game.

If their cards are equally strong, the game is drawn.  

You are watching Alice and Bob playing the game, and can see their hands.

The number written on Alice's card is A, and the number written on Bob's card is B.

Write a program to determine the outcome of the game.  

Constraints

1≦A≦13 

1≦B≦13 

A and B are integers.

Input

The input is given from Standard Input in the following format:

A B

Output

Print Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.

Sample Input 1

8 6

Sample Output 1

Alice

8 is written on Alice's card, and 6 is written on Bob's card.
Alice has the stronger card, and thus the output should be Alice.

Sample Input 2

1 1

Sample Output 2

Draw

Since their cards have the same number, the game will be drawn.

Sample Input 3

13 1

Sample Output 3

Bob



Sample input:
8 6


Sample output:
Alice

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    a, b = LI()
    if a == 1:
        a = 14
    if b == 1:
        b = 14

    if a == b:
        print('Draw')
    elif a > b:
        print('Alice')
    else:
        print('Bob')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
strength = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]

A, B = [strength.index(n) for n in map(int, input().split())]
if A > B:
    print('Alice')
elif A < B:
    print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
a = input().split(' ')
a[0] = int(a[0])
a[1] = int(a[1])

if (a[0] == 1): a[0] += 99
if (a[1] == 1): a[1] += 99

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
A=(A-2)%13
B=(B-2)%13
print(['Draw','Alice','Bob'][(A>B)-(B>A)])

Submission status: Accepted

Solution code:
Alice, Bob = map(int, input().split())
if Alice == 1 and Bob == 1:
  print("Draw")
elif Alice == 1 and Bob != 1:
  print("Alice")
elif Alice != 1 and Bob == 1:
  print("Bob")
elif Alice > Bob:
  print("Alice")
elif Alice == Bob:
  print("Draw")
else:
  print("Bob")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a == 1 and b == 1:
  print("Draw")
elif a == 1:
  print("Alice")
elif b == 1:
  print("Bob")
elif a > b:
  print("Alice")
elif a < b:
  print("Bob")
else:
  print("Draw")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a==b:
    print("Draw")


elif a!=b:
    if a!=1 and b!=1:
        if a>b:
            print("Alice") 
        elif a<b:
            print("Bob") 
    
    elif a==1:
        print("Alice") 
    else:
        print("Bob")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A == 1 and B == 13:
    winner = "Alice"
elif A == 13 and B == 1:
    winner = "Bob"
elif A > B:
    winner = "Alice"
elif A < B:
    winner = "Bob"
else:
    winner = "Draw"
print(winner)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a == b:
    print('Draw')
elif a == 1:
    print('Alice')
elif b == 1 or b > a:
    print('Bob')
else:
    print('Alice')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
    print("Draw")
elif b==1 :
    print("Bob")
elif a==1 or a>b:
    print("Alice")
elif a<b:
    print("Bob")

Submission status: Accepted

Solution code:
A,B=list(map(int, input().split()))
if A==1:
  if B==1:
    print('Draw')
  else:
    print('Alice')
else:
  if B==1:
    print('Bob')
  else:
    if A>B:
      print('Alice')
    elif A<B:
      print('Bob')
    else:
      print('Draw')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a==b:
  print('Draw')
elif a==1 and b == 13:
  print('Alice')
elif a==13 and b==1:
  print('Bob')
elif a > b:
  print('Alice')
elif b > a:
  print('Bob')

Submission status: Accepted

Solution code:
Alice,Bob = map(int,input().split())
if Alice == 1:
    Alice = 14
if Bob == 1:
    Bob = 14
if Alice>Bob:
    print('Alice')
elif Alice==Bob:
    print('Draw')
else:
    print('Bob')

Submission status: Accepted

Solution code:
M,N = map(int,input().split())

if M == N:
  print('Draw')
elif (M>N and N!=1) or M==1:
  print('Alice')
else:
  print('Bob')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
num = [2,3,4,5,6,7,8,9,10,11,12,13,1]
for i in range(1,14):
    if a == i:
        x = num.index(a)
    if b == i:
        y = num.index(b)
if x < y:
    print('Bob')
elif x > y:
    print('Alice')
else:
    print('Draw')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a == b:
    print('Draw')
elif a == 1:
    print("Alice")
elif b == 1:
    print('Bob')
elif a > b:
    print('Alice')
elif b > a:
    print('Bob')

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B = map(int, readline().split())
    A -= 2
    B -= 2
    if A % 13 > B % 13:
        print('Alice')
    elif A % 13 < B % 13:
        print('Bob')
    else:
        print('Draw')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a ==1:
    a=a+13
if b==1:
    b=b+13
if a>b:
    print('Alice')
elif a<b:
    print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
a=(a-2)%13
b=(b-2)%13
print([["Alice","Draw"][a==b],"Bob"][a<b])

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
a=(a-2)%13
b=(b-2)%13
print(["Draw","Bob","Alice"][((a==b)+1)*((a<b)-(b<a))])

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

def evaluate(x):
  if x != 1:
    return x
  return 14

a,b=map(evaluate,(a,b))

if a>b:print('Alice')
elif a==b:print('Draw')
else:print('Bob')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a == b: print('Draw')
elif a == 1: print('Alice')
elif b == 1: print('Bob')
elif a > b: print('Alice')
elif a < b: print('Bob')

Submission status: Accepted

Solution code:
a,b =map(int,input().split())
A,B,C =("Alice","Bob","Draw")
if max(a,b) ==13 and min(a,b) ==1:
  print(A) if a < b else print(B)
else:
  if a > b:
    print(A)  
  elif a < b:
    print(B)  
  else:
    print(C)

Submission status: Accepted

Solution code:

def main():
    a, b = map(int, input().split())
    if a-2 < 0:
        a = 14

    if b-2 < 0:
        b = 14

    if a-2 > b-2:
        print('Alice')
    elif a-2 < b-2:
        print('Bob')
    else:
        print('Draw')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
  print("Draw")
elif a==1:
  print("Alice")
elif b==1:
  print("Bob")
elif a>b:
  print("Alice")
elif b>a:
  print("Bob")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==1:
  if b==1:
    print("Draw")
  else:
    print("Alice")
else:
  if b==1:
    print("Bob")
  else:
    if a==b:
      print("Draw")
    elif a<b:
      print("Bob")
    else:
      print("Alice")

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

a, b = map(int, input().split())

if (a == 1):
    a = 14
if (b == 1):
    b = 14

if (a > b):
    print("Alice")
elif (a < b):
    print("Bob")
else:
    print("Draw")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

A,B = input().split()

A=int(A)

B=int(B)

if A == 1:
    A = 14

if B == 1:
    B = 14

if A>B:
    print("Alice")
elif A<B:
    print("Bob")
else:
    print("Draw")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == b:
    print('Draw')
elif (a > b and b != 1) or a == 1:
    print('Alice')
else:
    print('Bob')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==1:a=14
if b==1:b=14
if a>b:
    print("Alice")
elif a==b:
    print("Draw")
else:
    print("Bob")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a == 1:
  a += 13
if b == 1:
  b += 13

if a < b:
  ans = 'Bob'
elif a == b:
  ans = 'Draw'
else:
  ans = 'Alice'
print(ans)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
a = 14 if a == 1 else a
b = 14 if b == 1 else b
ans = "Draw"
if a > b:
    ans = "Alice"
elif b > a:
    ans = "Bob"
print(ans)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
if a == b:
    ans = "Draw"
elif a == 1 or (a > b >= 2):
    ans = "Alice"
elif b == 1 or (b > a >= 2):
    ans = "Bob"
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a==1 or b==1:
  print("Alice" if a<b
       else "Draw" if a==b
       else "Bob")
else:
  print("Alice" if a>b
       else "Draw" if a==b
       else "Bob")

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

a, b = map(int, input().split())

if a == 1:
    a = 14
if b == 1:
    b = 14

if a > b:
    print("Alice")
elif a == b:
    print("Draw")
else:
    print("Bob")

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
if a == 1:
  a = 14
else:
  a = a
if b == 1:
  b = 14
else:
  b = b
if a > b:
  print('Alice')
elif a == b:
  print('Draw')
else:
  print('Bob')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
s=[2,3,4,5,6,7,8,9,10,11,12,13,1]
a=s.index(a)
b=s.index(b)
if a>b:
    print("Alice")
elif a<b:
    print("Bob")
else:
    print("Draw")

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
if A == 1:
    A = 14

if B == 1:
    B = 14

if A > B:
    print('Alice')
elif A < B:
    print('Bob')
elif A == B:
    print('Draw')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
    print("Draw")
elif 1<a<b or b==1:
    print("Bob")
else:
    print("Alice")

Submission status: Accepted

Solution code:
A,B=map(int,input().split())

if A==B:
  print('Draw')
elif A==1:
  print('Alice')
elif B==1:
  print('Bob')
else:
  if A>B:
    print('Alice')
  else:
    print('Bob')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a == b:
	print("Draw")
elif (a > b and not b == 1) or a == 1:
	print("Alice")
elif a < b or b == 1:
	print("Bob")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == 1:
    a += 13
if b == 1:
    b += 13
if a > b:
    print("Alice")
elif a < b:
    print("Bob")
else:
    print("Draw")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a == b:
	print("Draw")
elif (a > b and not b == 1) or a == 1:
	print("Alice")
elif a < b or b == 1:
	print("Bob")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == 1:
    a = 14
if b == 1:
    b = 14
if a > b:
    print('Alice')
elif a < b:
    print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
A, B = MAP()
ind_A = X.index(A)
ind_B = X.index(B)
if ind_A > ind_B:
    print("Alice")
elif ind_A == ind_B:
    print("Draw")
else:
    print("Bob")

Submission status: Accepted

Solution code:
tmp = input().split(" ")
a = (int(tmp[0]) - 2) % 13
b = (int(tmp[1]) - 2) % 13
print("Alice") if a > b else print("Draw") if a == b else print("Bob")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a==1:
    a= 14
if b==1:
    b= 14
if a==b:
    print('Draw') 
elif a>b:
    print('Alice') 
else:
    print('Bob')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
lst = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]

if lst.index(a) > lst.index(b):
  print('Alice')
elif a == b:
  print('Draw')
else:
  print('Bob')

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    A, B = read_ints()
    if A == B:
        return 'Draw'
    if (A == 1 and B == 13):
        return 'Alice'
    if (A == 13 and B == 1):
        return 'Bob'
    if A > B:
        return 'Alice'
    return 'Bob'


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

A,B = MI()
if A == B:
    print('Draw')
    exit()
if A == 1:
    A = 14
if B == 1:
    B = 14
print('Alice' if A > B else 'Bob')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
  print("Draw")
elif a==1:
  print("Alice")
elif b==1:
  print("Bob")
else:
  print("Alice" if a>b else "Bob")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
    print('Draw')
elif a > b and b != 1:
    print('Alice')
elif a==1:
    print('Alice')
else:
    print('Bob')

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
A = (A + 12) % 14
B = (B + 12) % 14
if A > B : print("Alice")
elif A == B : print("Draw")
else : print("Bob")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a == b:
    print("Draw")
elif a == 1:
    print("Alice")
elif b == 1:
    print("Bob")
else:
    if a > b:
        print("Alice")
    else:
        print("Bob")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a == 1:
    a += 13
if b == 1:
    b += 13

if a > b:
    print('Alice')
elif a < b:
    print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
Alice, Bob = map(int, input().split())

if Alice < Bob:
    if Alice == 1:
        print("Alice")
    else:
        print("Bob")
elif Alice > Bob:
    if Bob == 1:
        print("Bob")
    else:
        print("Alice")
else:
    print("Draw")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main():
    
    A, B = map(int, input().split())

    if A == 1 and B != 1:
        ans = 'Alice'
    
    elif A != 1 and B == 1:
        ans = 'Bob'
    
    elif A == 1 and B == 1:
        ans = 'Draw'

    elif A > B:
        ans = 'Alice'

    elif A < B:
        ans = 'Bob'
    
    elif A == B:
        ans = 'Draw'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a==b:
  print('Draw')
elif a==1 or b!=1 and a>b:
  print('Alice')
else:
  print('Bob')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a==1 or b==1:
  if a>b:
    print('Bob')
  elif b>a:
    print('Alice')
  else:
    print('Draw')
else:
  if a>b:
    print('Alice')
  elif b>a:
    print('Bob')
  else:
    print('Draw')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a > b:
    if b == 1:
        print('Bob')
    else:
        print('Alice')
elif a < b:
    if a == 1:
        print('Alice')
    else:
        print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b: print("Draw")
elif a==1: print("Alice")
elif b==1: print("Bob")
else: print(["Alice","Bob"][a<b])

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, B = map(int, readline().split())
    if A == 1:
        A = 14
    if B == 1:
        B = 14

    if A > B:
        print('Alice')
    elif A < B:
        print('Bob')
    else:
        print('Draw')

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == b:
  print('Draw')
elif a > b and b!=1:
  print('Alice')
elif a==1:
  print('Alice')
else:
  print('Bob')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
    print("Draw")
elif a==1:
    print("Alice")
elif b==1:
    print("Bob")
elif a>b:
    print("Alice")
else:
    print("Bob")

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b = M()
if a == 1:
    a += 13
if b == 1:
    b += 13
if a == b:
    print('Draw')
elif a < b:
    print('Bob')
else:
    print('Alice')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
a, b, d = 'Alice', 'Bob', 'Draw'
if A == 1:
    A = 14
if B == 1:
    B = 14

if A > B:
    ans = a
elif A < B:
    ans = b
else:
    ans = d

print(ans)

Submission status: Accepted

Solution code:
A, B=map(int,input().split())
 
func=lambda x:[x,x+13][x==1]
 
if func(A)==func(B):
  print('Draw')
elif func(A)<func(B):
  print('Bob')
else:
  print('Alice')

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print("Draw" if a[0] == a[1] else ("Alice" if a[0] > a[1] and a[1] != 1 or a[0] == 1 else "Bob"))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print("Draw" if A==B else "Bob" if (A+13)%15<(B+13)%15 else "Alice")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == 1:
    a = 14
if b == 1:
    b = 14

if a == b:
    print("Draw")
elif a > b:
    print("Alice")
else:
    print("Bob")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

A,B = I()
if A == B:
    print('Draw')
elif A == 1:
    print('Alice')
elif B == 1:
    print('Bob')
elif A > B:
    print('Alice')
else:
    print('Bob')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
def conv(k):
    if k == 1:
        return k+1000
    else:
        return k
if conv(a) > conv(b):
    print('Alice')
elif conv(a) < conv(b):
    print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

A = (A + 11) % 13
B = (B + 11) % 13

print('Alice' if A > B else 'Draw' if A == B else 'Bob')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a == b:
    print("Draw")
elif a == 1:
    print("Alice")
elif b == 1:
    print("Bob")
else:
    print("Bob" if a < b else "Alice")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
L = list(range(2,14))+[1]
if L.index(a) > L.index(b):
  print('Alice')
elif L.index(a) == L.index(b):
  print('Draw')
else:
  print('Bob')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
List = [2,3,4,5,6,7,8,9,10,11,12,13,1]
c = 0
d = 0
for i in range(13):
  if a == List[i]:
    c = i
  if b == List[i]:
    d = i
if c == d:
  print("Draw")
elif c < d:
  print("Bob")
else:
  print("Alice")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

print("Draw" if a == b else "Alice" if ((a + 13) % 15 > (b + 13) % 15) else "Bob")

Submission status: Accepted

Solution code:
def jubge_winner():
    # 弱い順の数字をリスト化
    weak_strong_trump = [2,3,4,5,6,7,8,9,10,11,12,13,1]
    # ドロー
    A, B = map(int, input().split())
    # 大小判定
    A = weak_strong_trump.index(A)
    B = weak_strong_trump.index(B)
    # 結果
    if A > B:
        return 'Alice'
    elif A == B:
        return 'Draw'
    elif A < B:
        return 'Bob'

# 実行
result = jubge_winner()
print(result)