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

Solution (Python):
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")

Solution (Python):
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)

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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()

Solution (Python):
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')

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

Solution (Python):
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))])

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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)

Solution (Python):

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()

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):







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")

Solution (Python):



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")

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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")

Solution (Python):







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")

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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')

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

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):

















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")

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):


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())

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):


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()

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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])

Solution (Python):
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()

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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)

Solution (Python):
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')

Solution (Python):
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"))

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

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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")

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

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

Solution (Python):
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)

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b = il()
    if a == 1:
        a += 13
    if b == 1:
        b += 13
    print('Alice' if a > b else 'Draw' if a == b else 'Bob')


if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int,input().split())
if a ==1 :
    a=14
if b ==1:
    b=14
    
print(['Draw','Alice','Bob'][((a>b)-(b>a))])

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
a, b = map(int, input().split())
lst = [i for i in range(2, 14)] + [1]
if a == b:
  print('Draw')
else:
  print(['Bob', 'Alice'][lst.index(a) > lst.index(b)])

Solution (Python):
A,B = (int(x) for x in input().split())
if A == B:
  print ('Draw')
elif A > B:
  if A == 13 and B == 1:
    print ('Bob')
  else:
    print ('Alice')
else:
  if A == 1 and B == 13:
    print ('Alice')
  else:
    print ('Bob')

Solution (Python):
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')

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

Solution (Python):


a, b = map(int,input().split())
l = [i for i in range(2,14)]
l.append(1)

ia = l.index(a)
ib = l.index(b)
def p(s):
    print(s)
if ia > ib:
    p("Alice")
elif ia < ib:
    p("Bob")
else:
    p("Draw")

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

if a == 1 and b == 1:
    a = 14
    b = 14
elif a == 1:
    a = 14
elif b == 1:
    b = 14

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

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

Solution (Python):
A = list(map(int, input().split()))
A = list(map(lambda x: 14 if x == 1 else x, A))

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

Solution (Python):
A,B=map(int,input().split())
if A==1 or B==1:
  if A==B:
    print('Draw')
    exit()
  else:
    if A==1:
      print('Alice')
      exit()
    else:
      print('Bob')
      exit()
if A>B:
  print('Alice')
elif A==B:
  print('Draw')
else:
  print('Bob')

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

Solution (Python):
import sys
input = sys.stdin.readline

A,B = list(map(int,input().split()))
A = (A-2)%13
B = (B-2)%13
print('Alice' if A>B else 'Bob' if B>A else 'Draw')

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

Solution (Python):
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')

Solution (Python):
a, b = list(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")

Solution (Python):
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")

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

Solution (Python):
x,y=map(int,input().split())
if x==y:
    print('Draw')
elif x<y and x==1:
    print('Alice')
elif x>y and y==1:
    print('Bob')
else:
    print('Alice' if x>y else 'Bob')

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

Solution (Python):
A, B = map(int, input().split())
C = []
for i in range(2,14):
  C.append(i)
C.append(1)

if C.index(A) < C.index(B):
  print("Bob")
elif C.index(A) == C.index(B):
  print("Draw")
else:
  print("Alice")

Solution (Python):
a,b=map(lambda x:(int(x)+11)%13,input().split());print("Alice"if a>b else"Draw"if a==b else"Bob")

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

Solution (Python):
alice, bob = map(int, input().split())
if alice == 1 and bob != 1:
    print('Alice')
elif alice != 1 and bob == 1:
    print('Bob')
elif alice == bob:
    print('Draw')
else:
    if alice < bob:
        print('Bob')
    else:
        print('Alice')

Solution (Python):
a, b = list(map(int, input().split()))
if a == b:
    print("Draw")
else:
    if a != 1 and b != 1:
        if a > b:
            print("Alice")
        else:
            print("Bob")
    else:
        if a == 1:
            print("Alice")
        else:
            print("Bob")

Solution (Python):
A,B = map(int,input().rstrip().split(" "))
if A == 1: A = 14
if B == 1: B = 14
if A > B:print("Alice")
elif A < B: print("Bob")
else: print("Draw")

Solution (Python):
A, B = map(int, input().split())
A = (A - 2) % 13
B = (B - 2) % 13
if A < B:
  print("Bob")
elif A == B:
  print("Draw")
else:
  print("Alice")

Solution (Python):
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')

Solution (Python):
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")

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

Solution (Python):
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")

Solution (Python):

lst = input().split()

A = int(lst[0])
B = int(lst[1])


if A == 1 or B == 1:
   if A == B == 1:
      result = 'Draw'
   elif A == 1:
      result = 'Alice'
   elif B == 1:
      result = 'Bob'
else:
   if A == B:
      result = 'Draw'
   elif A < B:
      result = 'Bob'
   elif A > B:
      result = 'Alice'


print(result)

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
a,b=map(lambda x:(int(x)+13)%15,input().split())
print("Alice" if a>b else "Bob" if a<b else "Draw")

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

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

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

if (a+11)%13>(b+11)%13:
  print("Alice")
elif (a+11)%13<(b+11)%13:
  print("Bob")
else:
  print("Draw")

Solution (Python):
a, b = map(int, input().split())
l = [i for i in range(2, 14)] + [1]

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

Solution (Python):
a,b=map(int,input().split())
print(('ADlriacwe'[a==b::2],'Bob')[(a-2)%13<(b-2)%13])

Solution (Python):
a,b=map(int,input().split())
print(('ADlriacwe'[a==b::2],'Bob')[(a-2)%13<(b-2)%13])

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

Solution (Python):
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")

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

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

    if A == B:
        print('Draw')
    elif A == 1 or 0 < A - B < 12:
        print('Alice')
    elif B == 1 or A < B:
        print('Bob')

if __name__ == '__main__':
    main()

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

a = 14 if a == 1 else a
b = 14 if b == 1 else b

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

Solution (Python):
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('Bob')
else:
  print('Alice')

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

if (A == 1) and (B != 1):
    print("Alice")

elif (A != 1) and (B != 1) and (A > B):
    print("Alice")

elif (B == 1) and (A != 1):
    print("Bob")

elif (B != 1) and (A != 1) and (A < B):
    print("Bob")

elif (A == B):
    print("Draw")

Solution (Python):
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")

Solution (Python):
def actual(A, B):
    if A == B:
        return 'Draw'

    if A == 1:
        return 'Alice'

    if B == 1:
        return 'Bob'

    if A > B:
        return 'Alice'
    else:
        return 'Bob'

A, B = map(int, input().split())
print(actual(A, B))

Solution (Python):


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

a = 14 if a == 1 else a
b = 14 if b == 1 else b

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

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

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

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

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

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

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

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

Solution (Python):
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('Bob')
else:
  print('Alice')

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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