{"raw_statement":[{"iden":"problem statement","content":"Dolphin resides in two-dimensional Cartesian plane, with the positive $x$\\-axis pointing right and the positive $y$\\-axis pointing up.  \nCurrently, he is located at the point $(sx,sy)$. In each second, he can move up, down, left or right by a distance of $1$.  \nHere, both the $x$\\- and $y$\\-coordinates before and after each movement must be integers.  \nHe will first visit the point $(tx,ty)$ where $sx < tx$ and $sy < ty$, then go back to the point $(sx,sy)$, then visit the point $(tx,ty)$ again, and lastly go back to the point $(sx,sy)$.  \nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points $(sx,sy)$ and $(tx,ty)$.  \nUnder this condition, find a shortest path for him."},{"iden":"constraints","content":"*   $-1000 ≤ sx < tx ≤ 1000$\n*   $-1000 ≤ sy < ty ≤ 1000$\n*   $sx,sy,tx$ and $ty$ are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$sx$ $sy$ $tx$ $ty$"},{"iden":"sample input 1","content":"0 0 1 2"},{"iden":"sample output 1","content":"UURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\n*   Going from $(sx,sy)$ to $(tx,ty)$ for the first time: $(0,0)$ → $(0,1)$ → $(0,2)$ → $(1,2)$\n*   Going from $(tx,ty)$ to $(sx,sy)$ for the first time: $(1,2)$ → $(1,1)$ → $(1,0)$ → $(0,0)$\n*   Going from $(sx,sy)$ to $(tx,ty)$ for the second time: $(0,0)$ → $(-1,0)$ → $(-1,1)$ → $(-1,2)$ → $(-1,3)$ → $(0,3)$ → $(1,3)$ → $(1,2)$\n*   Going from $(tx,ty)$ to $(sx,sy)$ for the second time: $(1,2)$ → $(2,2)$ → $(2,1)$ → $(2,0)$ → $(2,-1)$ → $(1,-1)$ → $(0,-1)$ → $(0,0)$"},{"iden":"sample input 2","content":"\\-2 -2 1 1"},{"iden":"sample output 2","content":"UURRURRDDDLLDLLULUUURRURRDDDLLDL"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}