{"raw_statement":[{"iden":"problem statement","content":"There are $N$ integers written on a blackboard. The $i$\\-th integer is $A_i$. Here, $N$ is even. Additionally, integers $L$ and $R$ are given.\nAlice and Bob will play a game. They alternately take turns, with Alice going first. In each turn, the player chooses a number written on the blackboard and erases it.\nThe game will end in $N$ turns. Then, let $s$ be the sum of the integers erased by Alice. If $L \\leq s \\leq R$, Alice wins; otherwise, Bob wins. Find which player will win when both players play optimally."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 5000$\n*   $N$ is even.\n*   $1 \\leq A_i \\leq 10^9$\n*   $0 \\leq L \\leq R \\leq \\sum_{1 \\leq i \\leq N} A_i$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $L$ $R$\n$A_1$ $A_2$ $\\cdots$ $A_N$"},{"iden":"sample input 1","content":"4 5 6\n3 1 4 5"},{"iden":"sample output 1","content":"Alice\n\nIn this game, Alice will always win. Below is a possible progression of the game.\n\n*   Alice erases $1$.\n*   Bob erases $4$.\n*   Alice erases $5$.\n*   Bob erases $3$.\n\nHere, the sum of the integers erased by Alice is $6$. Since $L \\leq 6 \\leq R$, Alice wins."},{"iden":"sample input 2","content":"2 2 3\n4 1"},{"iden":"sample output 2","content":"Bob"},{"iden":"sample input 3","content":"30 655 688\n42 95 9 13 91 27 99 56 64 15 3 11 5 16 85 3 62 100 64 79 1 70 8 69 70 28 78 4 33 12"},{"iden":"sample output 3","content":"Bob"},{"iden":"sample input 4","content":"30 792 826\n81 60 86 57 5 20 26 13 39 64 89 58 43 98 50 79 58 21 27 68 46 47 45 85 88 5 82 90 74 57"},{"iden":"sample output 4","content":"Alice"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}