【START】2015暑期训练——Piotr’s Ants

<p>Piotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing<br /> either left or right and walks at a constant speed of 1 cm/s. When two ants bump into each other, they<br /> both turn around (instantaneously) and start walking in opposite directions. Piotr knows where each<br /> of the ants starts and which direction it is facing and wants to calculate where the ants will end up T<br /> seconds from now.</p> <p></p>

<p>The first line of input gives the number of cases, N. N test cases follow. Each one starts with a line<br /> containing 3 integers: L , T and n (0 &le; n &le; 10000). The next n lines give the locations of the n ants<br /> (measured in cm from the left end of the pole) and the direction they are facing (L or R).</p> <p></p>

<p>For each test case, output one line containing &lsquo;Case #x:&rsquo; followed by n lines describing the locations<br /> and directions of the n ants in the same format and order as in the input. If two or more ants are at<br /> the same location, print &lsquo;Turning&rsquo; instead of &lsquo;L&rsquo; or &lsquo;R&rsquo; for their direction. If an ant falls off the pole<br /> before T seconds, print &lsquo;Fell off&rsquo; for that ant. Print an empty line after each test case.</p> <p></p>