

Marching AntsAnts! Aren't they fascinating. Thousands of these insects are marching their paths on and on. They can build highly organized anthills. Sometimes, however, they act a little bit stupidly. Imagine that you have a long piece of wood and a couple of ants is walking on top of it. Their behavioral pattern is very simple: each ant walks slowly forward with a constant speed of 1 cm per second. Whenever it meets another ant, both of them only touch with their antennae and immediately turn around and walk the opposite direction. If an ant comes to the end of the wood, it falls down and does not affect other ants anymore.
The picture above shows an example of moving ants in time 0 s. In one second, the ants E and A meet at position 2 and change their directions. The ant A then meets B in the next 1.5 seconds. At the same time (2.5 seconds after the start), the ants C and D will meet too. All four of them change their directions. In the next 0.5 second (time 3 s), the first ant (E) falls down off the left end, etc. Your task is to simulate the movement of ants. For simplicity, suppose that the ants have zero size (although the picture does not suggest this). Input SpecificationThe input consists of several scenarios. Each scenario starts with a line containing two integer numbers L and A, separated by a space. L is the length of the wood in cms (1 ≤ L ≤ 999 999), A is the number of ants at the beginning of the simulation (1 ≤ A ≤ L+1).
Then there are A lines, each containing a positive integer X_{i},
one space, and an uppercase letter. The number (0 ≤ X_{i} ≤ L)
specifies the position of the i^{th} ant and the letter its initial direction:
either " The input will be terminated by two zeros in the place of numbers L and A. Output Specification
For each test case, you should print a single line containing the text " Sample Input
Output for Sample Input
(The last sample input scenario corresponds to the picture.) 

University of Debrecen; Faculty of Informatics; v. 03/01/2019 