Problem:
Score : 700 points

Problem Statement

There is a circle with a circumference of L.
Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point.
On this circumference, there are N ants.
These ants are numbered 1 through N in order of increasing coordinate, and ant i is at coordinate X_i.

The N ants have just started walking.
For each ant i, you are given the initial direction W_i. Ant i is initially walking clockwise if W_i is 1; counterclockwise if W_i is 2.
Every ant walks at a constant speed of 1 per second.
Sometimes, two ants bump into each other.
Each of these two ants will then turn around and start walking in the opposite direction.

For each ant, find its position after T seconds.

Constraints

All input values are integers.

1 \leq N \leq 10^5

1 \leq L \leq 10^9

1 \leq T \leq 10^9

0 \leq X_1 < X_2 < ... < X_N \leq L - 1

1 \leq W_i \leq 2

Input

The input is given from Standard Input in the following format:

N L T
X_1 W_1
X_2 W_2
:
X_N W_N

Output

Print N lines.
The i-th line should contain the coordinate of ant i after T seconds. Here, each coordinate must be between 0 and L-1, inclusive.

Sample Input 1

3 8 3
0 1
3 2
6 1

Sample Output 1

1
3
0

1.5 seconds after the ants start walking, ant 1 and 2 bump into each other at coordinate 1.5.
1 second after that, ant 1 and 3 bump into each other at coordinate 0.5.
0.5 seconds after that, that is, 3 seconds after the ants start walking, ants 1, 2 and 3 are at coordinates 1, 3 and 0, respectively.

Sample Input 2

4 20 9
7 2
9 1
12 1
18 1

Sample Output 2

7
18
18
1

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            long l = in.nextLong();
            long t = in.nextLong();

            ArrayList<Pair> list1 = new ArrayList<>();
            ArrayList<Pair> list2 = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int x = in.nextInt();
                int w = in.nextInt();

                if (w == 1) {
                    list1.add(new Pair(x, i));
                } else {
                    list2.add(new Pair(x, i));
                }
            }

            long m = 2 * t / l;
            long p = 2 * t % l;

            int[] cnt = new int[n];
            int n1 = list1.size();
            int n2 = list2.size();
            for (int i = 0; i < n1; i++) {
                long x = list1.get(i).x;
                int id = list1.get(i).y;
                cnt[id] += m * n2;

                if (x + p + 1 >= l) {
                    cnt[id] += n2 - lowerBound(list2, x);
                    cnt[id] += lowerBound(list2, (x + p + 1) % l);
                } else {
                    cnt[id] += lowerBound(list2, x + p + 1) - lowerBound(list2, x);
                }
            }
            for (int i = 0; i < n2; i++) {
                long x = list2.get(i).x;
                int id = list2.get(i).y;
                cnt[id] += m * n1;

                if (x - p <= 0) {
                    cnt[id] += n1 - lowerBound(list1, (x - p + l) % l);
                    cnt[id] += lowerBound(list1, x);
                } else {
                    cnt[id] += lowerBound(list1, x) - lowerBound(list2, x - p);
                }
            }

            long[] ans = new long[n];
            for (int i = 0; i < n1; i++) {
                int id = (list1.get(i).y + cnt[list1.get(i).y]) % n;
                ans[id] = (list1.get(i).x + t) % l;
            }
            for (int i = 0; i < n2; i++) {
                int id = (list2.get(i).y - cnt[list2.get(i).y] % n + n) % n;
                ans[id] = (list2.get(i).x - t % l + l) % l;
            }

            for (int i = 0; i < n; i++) {
                out.println(ans[i]);
            }
        }

        int lowerBound(ArrayList<Pair> a, long x) {
            int high = a.size();
            int low = 0;
            while (high > low) {
                int mid = (high + low) / 2;
                if (a.get(mid).x < x) {
                    low = mid + 1;
                } else {
                    high = mid;
                }
            }
            return low;
        }

        public class Pair {
            long x;
            int y;

            Pair(long x, int y) {
                this.x = x;
                this.y = y;
            }

        }

    }

    static class InputReader {
        BufferedReader in;
        StringTokenizer tok;

        public String nextString() {
            while (!tok.hasMoreTokens()) {
                try {
                    tok = new StringTokenizer(in.readLine(), " ");
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
            }
            return tok.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

        public long nextLong() {
            return Long.parseLong(nextString());
        }

        public InputReader(InputStream inputStream) {
            in = new BufferedReader(new InputStreamReader(inputStream));
            tok = new StringTokenizer("");
        }

    }
}