CF342B Xenia and Spies

Xenia the vigorous detective faced $ n $ $ (n>=2) $ foreign spies lined up in a row. We'll consider the spies numbered from 1 to $ n $ from left to right. Spy $ s $ has an important note. He has to pass the note to spy $ f $ . Xenia interrogates the spies in several steps. During one step the spy keeping the important note can pass the note to one of his neighbours in the row. In other words, if this spy's number is $ x $ , he can pass the note to another spy, either $ x-1 $ or $ x+1 $ (if $ x=1 $ or $ x=n $ , then the spy has only one neighbour). Also during a step the spy can keep a note and not pass it to anyone. But nothing is that easy. During $ m $ steps Xenia watches some spies attentively. Specifically, during step $ t_{i} $ (steps are numbered from 1) Xenia watches spies numbers $ l_{i},l_{i}+1,l_{i}+2,...,r_{i} $ $ (1

The first line contains four integers $ n $ , $ m $ , $ s $ and $ f $ $ (1

Print $ k $ characters in a line: the $ i $ -th character in the line must represent the spies' actions on step $ i $ . If on step $ i $ the spy with the note must pass the note to the spy with a lesser number, the $ i $ -th character should equal "L". If on step $ i $ the spy with the note must pass it to the spy with a larger number, the $ i $ -th character must equal "R". If the spy must keep the note at the $ i $ -th step, the $ i $ -th character must equal "X". As a result of applying the printed sequence of actions spy $ s $ must pass the note to spy $ f $ . The number of printed characters $ k $ must be as small as possible. Xenia must not catch the spies passing the note. If there are miltiple optimal solutions, you can print any of them. It is guaranteed that the answer exists.