There is a shopping mall called Hypermarket in Khorezmston. You are a scooter robot in this mall. Your task is to find all the lost scooters at the end of the day and return them to the scooter warehouse. The mall is an infinite-dimensional coordinate plane containingnscooters that need to be returned.
You can move in one of four directions: up, down, left, or right, and each move lasts one second. If you move to a space where a scooter is, that scooter will move to the next space in the direction you are moving. The same will happen if a scooter moves to a space where another scooter is, so there will never be more than one scooter in each space, and you will never occupy the same space as a scooter. If the scooter arrives at the storage location, it will disappear. However, the robot scooter can move freely around the warehouse.
The hypermarket will close soon. You need to find a way to deliver all the scooters to the warehouse in 105 seconds.
The first line contains the number of scooters,n(1≤n≤60).
The next line contains two natural numbers, the coordinates of the robot,x0,y0(0≤x0,y0≤28).
The next line contains two natural numbers, the coordinates of the warehouse,xo,yo(0≤xo,yo≤28).
In The following lines give the coordinates of each scooter,n,xi,yi(0≤xi,yi≤28).
Print a sequence of single-line movement instructions (left– L, right– R, down– D, up– U).
If there is more than one solution, print any one. Note that it is not necessary to minimize the number of actions.
8 2 2 5 5 6 5 7 5 4 5 3 5 5 6 5 7 5 4 5 3
UUURRDDDRUURRRULLUUULDD
1 5 5 7 5 6 5
R