{"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\"\u003eSmzzl is going to make an AI for Greedy Snake. The game goes on xOy plane and there is no obstacles in the plane.\u003cbr\u003e\u003cbr\u003eIn this game, the snake takes $1$ unit of time to move forward for one unit of length. It also takes $1$ unit of time for the snake to rotate for 90 degrees. (The snake must rotate for the whole unit of time.) There is a food in the map initially. After the snake eat each food, the next food appears.\u003cbr\u003e\u003cbr\u003eSmzzl certainly want the snake to eat the food as fast as possible, so he need to minimize the time when the snake eat each food. Please output a valid operate sequence.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of multiple test cases. \u003cbr\u003e\u003cbr\u003eThe first line contains an integer $T$ ($1 \\leq T \\leq 200$) -- the number of test cases.\u003cbr\u003e\u003cbr\u003eFor each test case:\u003cbr\u003e\u003cbr\u003eIn the first line, there are three integers $x,y,d$ ($|x|,|y| \\leq 10^4$, $0 \\leq d \\leq 3$). The snake starts on $(x,y)$. $d$ shows the direction of the head of the snake. (0 for y+, 1 for x+, 2 for y-, 3 for x-)\u003cbr\u003e\u003cbr\u003eIn the second line, there is an integer $n$ ($1 \\leq n \\leq 10^5$), which is the number of foods.\u003cbr\u003e\u003cbr\u003eIn the next $n$ lines, each contains two integers $x,y$ ($|x|,|y| \\leq 10^4$), which means the next food appears at $(x,y)$.\u003cbr\u003e\u003cbr\u003eIt is guaranteed that \u003cb\u003eany line that connects two foods that appear adjacently does not parallel to the x-axis or the y-axis\u003c/b\u003e.\u003cbr\u003e\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output the shortest operation sequence. Output \u0027f\u0027 for going forward, \u0027c\u0027 for rotating clockwise, \u0027u\u0027 for rotating counterclockwise. Each operation lasts for one unit of time.\u003cbr\u003e\u003cbr\u003eIt can be proved that there is only one operation sequence which meets the requirements.\u003cbr\u003e\u003cbr\u003eIt is guranteed that the total length of output does not exceed $2 \\times 10^6$."}},{"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\u003e2\r\n0 0 0\r\n2\r\n-1 -1\r\n1 1\r\n0 0 2\r\n5\r\n-1 2\r\n2 4\r\n3 -5\r\n4 -2\r\n5 0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eufufuffuff\r\ncfcffffcffffcfffffffffufufffffcf\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}