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 sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
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()

Submission status: Accepted

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

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:
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:
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)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
if a ==1:
  a += 100
if b ==1:
  b += 100
if a == b :
  print('Draw')
elif a > b :
  print('Alice')
else:
  print('Bob')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(lambda x:(int(x)+11)%13,input().split());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>b and b!=1 or a==1:
  print("Alice")
elif a<b or b==1:
  print("Bob")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
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")
if a > b:
    if b == 1:
        print("Bob")
    else:
        print("Alice")
if a < b:
    if 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:
#入力
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)

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:
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(lambda x:(int(x)+13)%15,input().split())
print("Alice" if a>b else "Bob" if a<b else "Draw")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
#print(A,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:
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")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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('Draw')
elif a<b:
  print('Bob')
else:
  print('Alice')

Submission status: Accepted

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

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 ("Bob")
elif a > b:
    print ("Alice")
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('Draw')
elif a < b:
  print('Bob')
else:
  print('Alice')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a == 1 and b == 1:
    print("Draw")
    exit()
elif a == 1:
    print("Alice")
    exit()
elif b == 1:
    print("Bob")
    exit()

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

Submission status: Accepted

Solution code:
A = [i for i in range(2, 14)] + [1]
a, b = map(int, input().split())
c = -1
d = -1
for i in range(len(A)):
    if c == -1 and A[i] == a:
        c = i
    if d == -1 and A[i] == b:
        d = i

if c > d:
    print("Alice")
elif c < d:
    print("Bob")
else:
    print("Draw")

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

a,b=mp()
if a==1 and b==1:
    print("Draw")
    exit()
if a==1:
    print("Alice")
    exit()
if b==1:
    print("Bob")
    exit()
if a==b:
    print("Draw")
    exit()
if a>b:
    print("Alice")
    exit()
if b>a:
    print("Bob")
    exit()

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#import itertools
#from fractions import Fraction
#import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions  import gcd
#input=sys.stdin.readline
#import bisect
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("Bob")
elif a>b:
  print("Alice")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==b:
  print('Draw')
else:
  if 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())

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())
ans = "Bob"
if a < b:
    if a == 1: ans = "Alice"
elif a > b:
    if b != 1: ans = "Alice"
elif a == b:
    ans = "Draw"
print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
import math

# import copy
from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)

def solve():
    a, b = getList()
    if a == b:
        print("Draw")
        return
    if a == 1:
        print("Alice")
        return
    if b == 1:
        print("Bob")
        return
    if a > b:
        print("Alice")
    else:
        print("Bob")

def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = [14 if x == 1 else x for x in map(int,input().split())]
if lst[1] != 1 and lst[0] > lst[1] :
    print('Alice')
elif lst[0] != 1 and lst[0] < lst[1]:
    print('Bob')
else:
  print('Draw')

Submission status: Accepted

Solution code:
lst = list(map(int,input().split()))

if lst[1] != 1 and lst[0] > lst[1] :
    print('Alice')
elif lst[0] != 1 and lst[0] < lst[1]:
    print('Bob')
elif lst[1] == 1 and lst[0] != 1:
    print('Bob')
elif lst[0] == 1 and lst[1] != 1:
    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')
else:
    print('Bob')

Submission status: Accepted

Solution code:
import sys
A,B = map(int,input().split())
if A < 0 or A > 13 or B < 0 or B > 13:
    sys.exit()

if A == 1 or B == 1:
    if A == B:
        print("Draw")
    elif A == 1:
        print("Alice")
    elif B == 1:
        print("Bob")
    sys.exit()

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

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]
print('Alice'if num.index(a)>num.index(b) else 'Bob'if num.index(a)<num.index(b) else'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("Bob")
else:
    print("Alice")

Submission status: Accepted

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

if a == 1 and b == 1:
  print('Draw')
elif a == 1 and b != 1:
  print('Alice')
elif a != 1 and b == 1:
  print('Bob')
elif a != 1 and b != 1:
  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==1:
  A=14
if B==1:
  B=14

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
cards = [i for i in range(2, 14)] + [1]
A = cards.index(A)
B = cards.index(B)
if A > B:
    print('Alice')
elif B > A:
    print('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
Alice, Bob = map(lambda x: int(x) * 100 if x ==
                 '1' else int(x), input().split(' '))

if Alice == Bob:
    print('Draw')
elif Alice > Bob:
    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("Bob")
elif A == B:
  print("Draw")

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:
i = [int(s) for s in input().split()]
alice = i[0]
bob = i[1]

if alice == bob:
    print("Draw")
elif alice == 1:
    print("Alice")
elif bob == 1:
    print("Bob")
elif bob < alice:
    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")
else:
    if A > B:
        print("Alice")
    else:
        print("Bob")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b = map(int, input().split())
    L = list(range(2, 14)) + [1]
    idx_a = L.index(a)
    idx_b = L.index(b)
    if idx_a == idx_b:
        print("Draw")
    elif idx_a < idx_b:
        print("Bob")
    else:
        print("Alice")


if __name__ == '__main__':
    resolve()

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:
#!python3

LI = lambda: list(map(int, input().split()))

# input
A, B = LI()


def main():
    a = 100 if A == 1 else A
    b = 100 if B == 1 else B
    if a > b:
        ans = "Alice"
    elif a < b:
        ans = "Bob"
    else:
        ans = "Draw"
    print(ans)


if __name__ == "__main__":
    main()

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('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')
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())
c = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
if c.index(a) > c.index(b):
    print('Alice')
elif c.index(a) == c.index(b):
    print('Draw')
else:
    print('Bob')

Submission status: Accepted

Solution code:
def checkCard(x, y):
  if x == 1 and y == 13:
    return "Alice"
  elif x == 13 and y == 1:
    return "Bob"
  elif x == 1 and y == 1:
    return "Draw"
  else:
    return ""

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

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')
  elif a > b:
    print('Alice')
  elif a == b:
    print('Draw')
  else:
    print('Bob')

Submission status: Accepted

Solution code:
p=[2,3,4,5,6,7,8,9,10,11,12,13,1]
a,b=map(int,input().split())
print('ABloibc e'[p.index(a)<p.index(b)::2] if a!=b else 'Draw')

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 == 1):
  a = 14
if(b == 1):
  b = 14
[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 = a + 100
if b == 1:
    b = b + 100
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:
  ans = 'Draw'
elif a == 1:
  ans = 'Alice'
elif b == 1:
  ans = 'Bob'
elif a > b:
  ans = 'Alice'
else:
  ans = 'Bob'
print(ans)

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')
elif (a<b and a!=1) or (b==1): print('Bob')

Submission status: Accepted

Solution code:
import sys

A, B = list(map(int, input().split()))

if A == B:
  print("Draw")
  sys.exit()

if A == 1:
  A = 14
elif B == 1:
  B = 14

if A > B:
  print("Alice")
else:
  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")
  elif a == b:
    print("Draw")
  elif a<b:
    print("Bob")
  elif a>b:
    print("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('Alice')
elif A==B:
  print('Draw')
else:
  print('Bob')

Submission status: Accepted

Solution code:
A,B=[int(i) for i in input().split(" ")]
if A==B:
  print("Draw")
elif (A==1) or (A>2 and (A>B) and B!=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('Bob')
else:
    print('Alice')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from itertools import accumulate #list(accumulate(A))
'''
N = ii()
A = li()

ans = 0
for i in range(N):
    a = 0
    b = 0
    max_b = -float('inf')
    max_a = -float('inf')
    for j in range(i, N):
        if (j-i) % 2:
            b += A[j]
            if b > max_b:
                max_b = b
                max_a = a
        else:
            a += A[j]
    dp[max_a][]
    ans = max(ans, max_a)

print(ans)
'''

A, B =li()

if A == B == 1:
    print('Draw')
elif A == 1:
    print('Alice')
elif B == 1:
    print('Bob')
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!=1 and B!=1 and A>B)or(A==1 and B!=1)):
  print("Alice")
elif(A==B):
  print("Draw")
else:
  print("Bob")

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')
elif a < b:
    print('Bob')
else:
    print('Alice')

Submission status: Accepted

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

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:
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')

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:
n = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
A, B = map(int, input().split())
idxa = n.index(A)
idxb = n.index(B)

if idxa > idxb:
  print('Alice')
elif idxa == idxb:
  print('Draw')
else:
  print('Bob')

Submission status: Accepted

Solution code:
cards = input()
cards_s = cards.split()

porker_list = ['2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '13', '1']

alice_str = cards_s[0]
alice_s = porker_list.index(alice_str)
alice = int(alice_s)

bob_str = cards_s[1]
bob_s = porker_list.index(bob_str)
bob = int(bob_s)

if alice > bob:
    print('Alice')
elif alice == bob:
    print('Draw')
else:
    print('Bob')