Start

2020-11-16 12:30 AKST

Coding Minds

End

2020-11-23 12:00 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -68 days 11:54:04

Time elapsed

167:30:00

Time remaining

0:00:00

Problem D
Endor

On the forest-filled moon of Endor there is, if we are to believe the Guinness Book of Records, the longest stick in the whole galaxy. On that stick of $L$ meters in length there are $N$ cheerful chameleons. Each chameleon is moving along the stick with constant speed of $1\, \mathrm{m}/\mathrm{s}$ in one of two possible directions (left or right) and is colored in one of the possible $K$ colors.

It is known that the chameleons of Endor worship the ancient ant laws that dictate that the walk along the stick must be continued until the end of the stick is reached (which means getting off it), and when a collision with another chameleon takes place, you must turn $180$ degrees and continue the walk in the opposite direction. Additionally, after a chameleon colored in colour $a$ moving to the left collides with a chameleon colored in colour $b$ moving to the right, the chameleon moving to the left before the collision takes the color of the chameleon moving to the right before the collision (so, color $b$), while the chameleon moving to the right before the collision takes a new color $(a + b) \bmod K$.

If you are given the initial positions, colors and directions of movement of all the chameleons, for each color determine the total trip taken by the chameleons in that color before getting off the stick.

Input

The first line of input contains the integers $N$, $K$ and $L$ ($1 \leq N \leq 100\, 000$, $1 \leq K \leq 40$, $1 \leq L \leq 1\, 000\, 000$) from the task. The $i$-th of the following $N$ lines contains the integer $d_ i$ ($0 \leq d_ i \leq L$) that denotes the distance between the $i$-th chameleon and the left end of the stick, then the integer $b_ i$ ($0 \leq b_ i \leq K - 1$) that denotes the color of the $i$-th chameleon and the character ‘L’ (left) or ‘D’ (right) that denote the direction of movement of the $i$-th chameleon. All integers $d_ i$ will be unique and given in strictly ascending order.

Output

The output must contain $K$ lines, the $i$-th line containing the total trip taken by the chameleons in color $i$.

Sample Input 1 Sample Output 1
2 3 10
0 0 D
10 1 L
10.0
10.0
0.0
Sample Input 2 Sample Output 2
4 3 7
1 0 D
3 0 D
4 1 L
6 2 D
10.0
4.0
1.0
Sample Input 3 Sample Output 3
4 4 5
1 1 D
3 3 L
4 2 D
5 0 L
2.5
4.0
2.5
4.0