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:
A,B = (int(x) for x in 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 == 1:
  A = 15
if B == 1:
  B = 15
print("Alice" if A > B else "Draw" if A == B else "Bob")

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
ab = readints()
if ab[0] == 1 and ab[1] == 1:
    print('Draw')
    exit()
if ab[0] == 1:
    print('Alice')
    exit()
if ab[1] == 1:
    print('Bob')
    exit()
if ab[0] < ab[1]:
    print('Bob')
    exit()
if ab[0] > ab[1]:
    print('Alice')
    exit()
if ab[0] == ab[1]:
    print('Draw')
#t = list(map(str, input()))
# print(t)
#p_cnt = 0
#d_cnt = 0
# for i in range(len(t)):
#    if t[i] == 'P':
#        p_cnt += 1
#    if t[i] == 'D':
#        d_cnt += 1
# if p_cnt > d_cnt:
#    for i in range(len(t)):
#        if t[i] == '?':
#            if t[i-1] == 'P':
#                t[i] = 'D'
#            if t[i-1] == 'D':
#                t[i] = 'P'
#    tt = ''.join(t)
#    print(tt)
# else:
#    for i in range(len(t)):
#        if t[i] == '?':
#            t[i] = 'D'
#    tt = ''.join(t)
#    print(tt)
#

Submission status: Accepted

Solution code:
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]

if 1 <= a <= 13 and 1 <= b <= 13:
  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 == 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=list(map(int, input().split()))
if A==B:
  print("Draw")
elif A == 1 and B != 1:
  print("Alice")
elif B == 1 and A != 1:
  print("Bob")
elif A > B:
  print("Alice")
else:
  print("Bob")

Submission status: Accepted

Solution code:
a,b = list(map(int,input().strip().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 b > a:
  print("Bob")
else:
  print("Draw")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
card = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
alice, bob = map(int, input().split())
if card.index(alice) > card.index(bob):
    print('Alice')
elif card.index(alice) < card.index(bob):
    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')
elif a<b:
  print('Bob')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
power = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
 
a = power.index(a)
b = power.index(b)
 
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())
power = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]

a = power.index(a)
b = power.index(b)

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

Submission status: Accepted

Solution code:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

def main():
    a,b = cin()
    if a==1:
      a=14
    if b==1:
      b=14
    if a>b:
      print("Alice")
    elif a<b:
      print("Bob")
    else:
      print("Draw")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
A,B = map(int,input().split())

if A==B:
    print("Draw")
else:
    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 == 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==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:
# -*- coding: utf-8 -*-

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-2)%13 > (B-2)%13:
  print('Alice')
elif (A-2)%13 < (B-2)%13:
  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 == 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())

list=[2,3,4,5,6,7,8,9,10,11,12,13,1]
# print(list.index())

a_val=list.index(a)
b_val=list.index(b)

if a_val>b_val:print('Alice')
elif a_val<b_val: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('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:
from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))

tmp = LI()
for i in range(2):
    if tmp[i]==1:
        tmp[i] = 999

a,b = [tmp.pop(0) for _ in range(2)]

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


a, b = LI()
if (a == 1 and b == 1) or 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:
n = input().split()
a = int(n[0])
b = int(n[1])
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:
n = input().split()
a = int(n[0])
b = int(n[1])
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==1:
    a=100
if b==1:
    b=100
if a>b:
    print('Alice')
elif a==b:
    print('Draw')
else:
    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('Bob')
else:
    print('Draw')

Submission status: Accepted

Solution code:
# ACB054A
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 and a!=1 and b!=1:
    print("Alice")
elif a<b and a!=1 and b!=1:
    print("Bob")
elif a==b:
    print("Draw")
elif a==1:
    print("Alice")
else:
    print("Bob")

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a>b and a!=1 and b!=1:
    print("Alice")
elif a<b and a!=1 and b!=1:
    print("Bob")
elif a==b:
    print("Draw")
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:
s = [i for i in range(2,14)] + [1]
a, b = map(int, input().split())
c=s.index(a)
d=s.index(b)
print('Draw' if c==d else ["Bob","Alice"][c > d])

Submission status: Accepted

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

for A in range(2):
    if As[A]==1:
        As[A]+=13
        
if As[0]==As[1]:
    print("Draw")
elif As[0]>As[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 and a<b or b==1):
    print('Bob')
else:
    print('Alice')

Submission status: Accepted

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

Submission status: Accepted

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

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:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    if a == 1 and b == 1:
        print('Draw')
    elif a == 1:
        print('Alice')
    elif b == 1:
        print('Bob')
    else:
        if a > b:
            print('Alice')
        elif a == b:
            print('Draw')
        else:
            print('Bob')


if __name__ == "__main__":
    main()

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:
i = [p+2 for p in range(12)]
i.append(1)
x, y = map(int, input().split())
if i.index(x) == i.index(y):
    print("Draw")
if i.index(x) > i.index(y):
    print("Alice")
if i.index(x) < i.index(y):
    print("Bob")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a = [i if i != 1 else 14 for i in 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())
def Main(A, B):
    if A == B:
        return 'Draw'
    elif A == 1:
        return 'Alice'
    elif B == 1:
        return 'Bob'
    else:
        return 'Alice' if A > B else 'Bob'
    
print(Main(A, B))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

def main():
    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')    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
power = [2,3,4,5,6,7,8,9,10,11,12,13,1,]
A,B = map(int, input().split())
if power.index(A) > power.index(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=14
if B==1:
    B=14
if A>B:
    print ("Alice")
elif B>A:
    print ("Bob")
else:
    print ("Draw")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
if x.index(a) > x.index(b):
    print('Alice')
elif x.index(a) < x.index(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("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 == 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==1 and B==1:
    A=14
    B=14
elif A==1 and B!=1:
    A=14
elif B==1 and A!=1:
    B=14
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())

ans = str()
if a == 1 or b == 1:
    if a == 1 and b == 1:
        ans = "Draw"
    elif a == 1:
        ans = "Alice"
    elif b == 1:
        ans = "Bob"
else:
    if a > b:
        ans = "Alice"
    elif b > a:
        ans = "Bob"
    else:
        ans = "Draw"

print(ans)

Submission status: Accepted

Solution code:
def main():
 num = list(map(int,input().split()))
 if(num[0]>num[1]):
  if(num[1]!=1):
   print('Alice')
  else:
   print('Bob')
 elif(num[1]>num[0]):
  if(num[0]!=1):
   print('Bob')
  else:
   print('Alice')
 else:
   print('Draw') 

main()

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
A=(A+13)%15
B=(B+13)%15

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

Submission status: Accepted

Solution code:
def main():
    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'
    elif a < b:
        ans = 'Bob'
    print(ans)


if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 17:01:05 2020

@author: shinba
"""

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

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

Submission status: Accepted

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

Submission status: Accepted

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

def judge(a,b):
  if a > b > 1 or (a == 1 and b != 1):
    return "Alice"
  elif a == b:
    return "Draw"
  else:
    return "Bob"
  
print(judge(A,B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B = inputIL()

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())
a=(a+11)%13
b=(b+11)%13
if a>b:
  print("Alice")
elif a<b:
  print("Bob")
else:
  print("Draw")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B = map(lambda x: int(x) + (13 if x == '1' else 0), input().split())
print('Draw' if A == B else ['Bob', 'Alice'][A > B])

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    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')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

if A == B:
  print('Draw')
elif order.index(A) > order.index(B):
  print('Alice')
else:
  print('Bob')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Score_Alice, Score_Bob = map(int, input().split())

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

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 "Bob" if b>a else "Draw" )

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
l=[2,3,4,5,6,7,8,9,10,11,12,13,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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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, groupby
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
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
import numpy as np

AB = LIST()

for i in range(2):
	if AB[i] == 1:
		AB[i] += 13

if AB[0] > AB[1]:
	print("Alice")
elif AB[0] < AB[1]:
	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==1:
    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")
else:
    if a == 1:
        print("Alice")
        exit()
    elif b == 1:
        print("Bob")
        exit()
    if a > b:
        print("Alice")
    else:
        print("Bob")

Submission status: Accepted

Solution code:
A, B = map(lambda x: (int(x)-2)%13, input().split())
print("Alice" if A > B else ("Draw" if A == B else "Bob"))

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