南京多校出题～

Little A and little B are playing stone games.There are $N$ bottles,labeled 1 to $N$,each with a capacity of $A_i$.Initially,the bottles are all full.
In each turn,the player takes a certain amount of stones from every bottle. Different from the past, each person takes up at most $r_i$ stones from each bottle, ($r_i<=a_i$), and at least takes $l_i$ stones ($l_i>=0$),and put them into the stone library(initially empty).
When $r_i$ is greater than $a_i,r_i=min(r_i,a_i)$, when $l_i$ is greater than $a_i$, $l_i=min(l_i,a_i)$. You can also choose to take some of the stones from the stone library (independent of the stone pile) and put them back into the original bottle.The first person who takes all the stones wins.
You can assume that everyone takes the best strategy.

Input

First line, $N,K(1<=K<=N<=1e6)$
The second line $a_1,a_2,...,a_n(0<=ai<=1e9)$
The third line $l_1,l_2,...,l_n$
The fourth line $r_1,r_2,...,r_n(0<=l_i<=r_i<=a_i)$

Output

If A wins,print one line “A”,
else if B wins,print one line “B”,
else print one line “Draw”.

Sample Input

3
0 1 2
0 0 0
0 1 2

Sample Output

A