{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"There is a beautiful river in a small village. N rocks are arranged in a straight \nline numbered 1 to N from left bank to the right bank, as shown below. \n\u003cp\u003e[Left Bank] - [Rock1] - [Rock2] - [Rock3] - [Rock4] ... [Rock n] - [Right Bank] \n\u003c/p\u003e\n\u003cp\u003eThe distance between two adjacent rocks is exactly 1 meter, while the distance \n between the left bank and rock 1 and the distance between Rock n and the right \n bank are also 1 meter. \u003c/p\u003e\n\u003cp\u003eFrog Frank was about to cross the river, his neighbor Frog Funny came to him \n and said, \u003c/p\u003e\n\u003cp\u003e\u0027Hello, Frank. Happy Children\u0027s Day! I have a gift for you. See it? A little \n parcel on Rock 5.\u0027 \u003c/p\u003e\n\u003cp\u003e\u0027Oh, that\u0027s great! Thank you! I\u0027ll get it.\u0027 \u003c/p\u003e\n\u003cp\u003e\u0027Wait...This present is for smart frogs only. You can\u0027t get it by jumping to \n it directly.\u0027 \u003c/p\u003e\n\u003cp\u003e\u0027Oh? Then what should I do?\u0027 \u003c/p\u003e\n\u003cp\u003e\u0027Jump more times. Your first jump must be from the left bank to Rock 1, then, \n jump as many times as you like - no matter forward or backward, but your ith \n jump must cover 2*i-1 meters. What\u0027s more, once you return to the left bank \n or reach the right bank, the game ends, and no more jumps are allowed.\u0027\u003c/p\u003e\n\u003cp\u003e \u0027Hmmm, not easy... let me have a think!\u0027 Answered Frog Frank, \u0027Should I give \n it a try?\u0027\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eInput\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003eThe input will contain no more than 2000 test cases. Each test case contains \n a single line. It contains two positive integers N (2\u0026lt;\u003dN\u0026lt;\u003d10^6), and M \n (1\u0026lt;\u003dM\u0026lt;\u003dN), M indicates the number of the rock on which the gift is located. \n A test case in which N\u003d0, M\u003d0 will terminate the input and should not be regarded \n as a test case. \u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eOutput\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003eFor each test case, output a single line containing \u0027Let me try!\u0027 If it\u0027s possible \n to get to Rock m, otherwise, output a single line containing \u0027Don\u0027t make fun \n of me!\u0027 \u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eSample Input\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e9 5\u003cbr\u003e\n 12 2\u003cbr\u003e\n 0 0\u003cbr\u003e\n\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eSample Output\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003eDon\u0027t make fun of me!\u003cbr\u003e\n Let me try!\u003c/p\u003e\n\u003cp\u003e\u003cb\u003eNote\u003c/b\u003e\u003cbr\u003e\n \u003cbr\u003e\n In test case 2, Frank can reach the gift in this way: \u003c/p\u003e\n\u003cp\u003eForward(to rock 4), Forward(to rock 9), Backward(to rock 2, got the gift!) \n\u003c/p\u003e\n\u003cp\u003eNote that if Frank jumps forward in his last jump, he will land on the right \n bank(assume that banks are large enough) and thus, lost the game.\u003cbr\u003e\n\u003c/p\u003e\n"}}]}