{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eAlice and Bob are playing a game called \"Climbing the Hill\". The game board consists of cells arranged vertically, as the figure below, while the top cell indicates the top of hill. There are several persons at different cells, and there is one special people, that is, the king. Two persons can\u0027t occupy the same cell, except the hilltop.\u003cbr\u003e\u003cbr\u003eAt one move, the player can choose any person, who is not at the hilltop, to climb up any number of cells. But the person can\u0027t jump over another one which is \u003cbr\u003eabove him. Alice and Bob move the persons alternatively, and the player who move the king to the hilltop will win. \u003cbr\u003e\u003cbr\u003e\u003ccenter\u003e\u003cimg style\u003d\"max-width:100%;\" src\u003d\"CDN_BASE_URL/194ffe623d247c5f55ad81dec7c96ed6?v\u003d1715775206\"\u003e\u003c/center\u003e\u003cbr\u003e\u003cbr\u003eAlice always move first. Assume they play optimally. Who will win the game?\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"There are several test cases. The first line of each test case contains two integers N and k (1 \u0026lt;\u003d N \u0026lt;\u003d 1000, 1 \u0026lt;\u003d k \u0026lt;\u003d N), indicating that there are N persons on the\u003cbr\u003ehill, and the king is the k-th nearest to the top. N different positive integers followed in the second line, indicating the positions of all persons. (The hilltop is No.0 cell, the cell below is No.1, and so on.) These N integers are ordered increasingly, more than 0 and less than 100000."}},{"title":"Output","value":{"format":"HTML","content":"If Alice can win, output \"Alice\". If not, output \"Bob\"."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 3\r\n1 2 4\r\n2 1\r\n100 200\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eBob\r\nAlice\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cbr\u003eThe figure illustrates the first test case. The gray cell indicates the hilltop. The circles indicate the persons, while the red one indicates the king. The first player Alice \u003cbr\u003ecan move the person on cell 1 or cell 4 one step up, but it is not allowed to move the person on cell 2.\u003cbr\u003e"}}]}