Codeforces 849D.Rooter's Song

D. Rooter's Song

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Wherever the destination is, whoever we meet, let's render this song together.

On a Cartesian coordinate plane lies a rectangular stage of size w × h, represented by a rectangle with corners (0, 0), (w, 0), (w, h) and (0, h). It can be seen that no collisions will happen before one enters the stage.

On the sides of the stage stand n dancers. The i-th of them falls into one of the following groups:

• Vertical: stands at (x_i, 0), moves in positive y direction (upwards);
• Horizontal: stands at (0, y_i), moves in positive x direction (rightwards).

According to choreography, the i-th dancer should stand still for the first t_i milliseconds, and then start moving in the specified direction at 1 unit per millisecond, until another border is reached. It is guaranteed that no two dancers have the same group, position and waiting time at the same time.

When two dancers collide (i.e. are on the same point at some time when both of them are moving), they immediately exchange their moving directions and go on.

Dancers stop when a border of the stage is reached. Find out every dancer's stopping position.

Input

The first line of input contains three space-separated positive integers n, w and h (1 ≤ n ≤ 100 000, 2 ≤ w, h ≤ 100 000) — the number of dancers and the width and height of the stage, respectively.

The following n lines each describes a dancer: the i-th among them contains three space-separated integers g_i, p_i, and t_i (1 ≤ g_i ≤ 2, 1 ≤ p_i ≤ 99 999, 0 ≤ t_i ≤ 100 000), describing a dancer's group g_i (g_i = 1 — vertical, g_i = 2 — horizontal), position, and waiting time. If g_i = 1 then p_i = x_i; otherwise p_i = y_i. It's guaranteed that 1 ≤ x_i ≤ w - 1 and 1 ≤ y_i ≤ h - 1. It is guaranteed that no two dancers have the same group, position and waiting time at the same time.

Output

Output n lines, the i-th of which contains two space-separated integers (x_i, y_i) — the stopping position of the i-th dancer in the input.

Examples

Input

8 10 8
1 1 10
1 4 13
1 7 1
1 8 2
2 2 0
2 5 14
2 6 0
2 6 1

Output

4 8
10 5
8 8
10 6
10 2
1 8
7 8
10 6

Input

3 2 3
1 1 2
2 1 1
1 1 5

Output

1 3
2 1
1 3

Note

The first example corresponds to the initial setup in the legend, and the tracks of dancers are marked with different colours in the following figure.

In the second example, no dancers collide.

【题解】

不（题）难（解）发（上）现（说）两个点能够相碰当且仅当p - t相等

于是我们可以按照p - t分组，发现两个点相碰可以看做穿过去。那么

最终位置与原始位置有什么对应关系呢？

我们把每个点的路径化成直线，交点意味着碰撞。我们发现一个点的行走轨迹是

阶梯状的，手画一下不难发现：左上->左下->右下方向的点对应左上->右上->

右下的点

于是两次间接排序即可

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #define max(a, b) ((a) > (b) ? (a) : (b))
 #define min(a, b) ((a) < (b) ? (a) : (b))

 const int INF = 0x3f3f3f3f;
 const int MAXN =  + ;

 inline void read(int &x)
 {
     x = ;char ch = getchar(), c = ch;
     while(ch < '' || ch > '')c = ch, ch = getchar();
     while(ch <= '' && ch >= '')x = x *  + ch - '', ch = getchar();
     if(c == '-')x = -x;
 }

 inline int abs(int a)
 {
     return a <  ? -*a : a;
 } 

 struct Node
 {
     int g, p, t, x, y;
 }node[MAXN],ans[MAXN];

 int n,w,h,cnt[MAXN],cnt2[MAXN];

 int cmp(int c, int d)
 {
     Node a = node[c], b = node[d];
     return (a.p - a.t == b.p - b.t) ? ( (a.y == b.y) ? (a.x > b.x) : (a.y < b.y)) : (a.p - a.t < b.p - b.t);
 }

 int cmp2(int c, int d)
 {
     Node a = node[c], b = node[d];
     return (a.p - a.t == b.p - b.t) ? ((a.x == b.x) ? (a.y < b.y) : (a.x > b.x)) : (a.p - a.t < b.p - b.t);
 }

 int main()
 {
     read(n), read(w), read(h);
     for(register int i = ;i <= n;++ i)
     {
         read(node[i].g), read(node[i].p), read(node[i].t);
         if(node[i].g == ) node[i].y = -, node[i].x = node[i].p;
         else node[i].y = node[i].p, node[i].x = -;
         cnt[i] = cnt2[i] = i;
     }
     std::sort(cnt + , cnt +  + n, cmp);
     for(register int i = ;i <= n;++ i)
         if(node[i].x != -)node[i].y = h;
         else node[i].x = w;
     std::sort(cnt2 + , cnt2 +  + n, cmp2);
     for(register int i = ;i <= n;++ i)
         ans[cnt[i]] = node[cnt2[i]];
     for(register int i = ;i <= n;++ i)
         printf("%d %d\n", ans[i].x, ans[i].y);
     return ;
 }

849D