CF652F.Ants on a Circle

n ants are on a circle of length m. An ant travels one unit of distance per one unit of time. Initially, the ant number i is located at the position s__i and is facing in the direction d__i (which is either L or R). Positions are numbered in counterclockwise order starting from some point. Positions of the all ants are distinct.

All the ants move simultaneously, and whenever two ants touch, they will both switch their directions. Note that it is possible for an ant to move in some direction for a half of a unit of time and in opposite direction for another half of a unit of time.

Print the positions of the ants after t time units.

有 n 只蚂蚁位于一个长度为 m 的圆周上。每只蚂蚁每单位时间移动 1 个单位距离。初始时，编号为 i 的蚂蚁位于位置 s__i，且朝向为 d__i（取值为 L 或 R）。位置沿逆时针方向从某一起点开始编号。所有蚂蚁的初始位置互不相同。

所有蚂蚁同时移动；每当两只蚂蚁相遇时，它们均立即掉转方向。注意：一只蚂蚁可能在某段时间内朝某一方向运动半个单位时间，随后在另一段时间内朝相反方向运动半个单位时间。

请输出经过 t 单位时间后各蚂蚁的位置。

The first line contains three integers n, m and t (2 ≤ n ≤ 3·105, 2 ≤ m ≤ 109, 0 ≤ t ≤ 1018) — the number of ants, the length of the circle and the number of time units.

Each of the next n lines contains integer s__i and symbol d__i (1 ≤ s__i ≤ m and d__i is either L or R) — the position and the direction of the i-th ant at the start. The directions L and R corresponds to the clockwise and counterclockwise directions, respectively.

It is guaranteed that all positions s__i are distinct.

第一行包含三个整数 $n$、$m$ 和 $t$（$2 \leq n \leq 3\cdot10^5$，$2 \leq m \leq 10^9$，$0 \leq t \leq 10^{18}$）—— 分别表示蚂蚁的数量、圆环的长度以及时间单位数。

接下来的 $n$ 行中，每行包含一个整数 $s_i$ 和一个字符 $d_i$（$1 \leq s_i \leq m$，且 $d_i$ 为 L 或 R）—— 分别表示第 $i$ 只蚂蚁的初始位置和初始方向。方向 L 和 R 分别对应顺时针和逆时针方向。

保证所有初始位置 $s_i$ 互不相同。

Print n integers x__j — the position of the j-th ant after t units of time. The ants are numbered from 1 to n in order of their appearing in input.

输出 n 个整数 x__j —— 表示第 j 只蚂蚁在 t 单位时间后的位置。蚂蚁按输入中出现的顺序编号为 1 到 n。