/*
СТРОИМ СТЕНУ РАБОТЯГИ!
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
 
  
  
using namespace std;
  
  
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
  
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
  
/** Read */
  
static const int buf_size = 4096;
  
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len) {
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    }
    if (pos == len) {
        return -1;
    }
    return buf[pos++];
}
  
inline int readChar() {
    int c = getChar();
    while (c <= 32) {
        c = getChar();
    }
    return c;
}
  
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
  
/** Write */
  
static int write_pos = 0;
static char write_buf[buf_size];
  
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
  
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
  
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
  
inline void writeWord( const char *s ) {     while (*s)
writeChar(*s++); }
  
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
  
using namespace std;


#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define rank rank228
const int MAXN = 100001;


int n;
long long l, t;
long long x[MAXN], w[MAXN];


int main() {
    n = readInt(), l = readInt(), t = readInt();
    l *= 2;
    t *= 2;
    for (int i = 0; i < n; i++) {
        x[i] = readInt(), w[i] = readInt();
        x[i] *= 2;
    }
    long long cnt = 0;
    for (int i = 1; i < n; i++) {
        if (w[0] == 1) {
            if (w[i] == 2) {
                long long len = (x[i] - x[0]) / 2;
                if (len <= t) {
                    long long cnts = 1 + 2LL * (t - len) / l;
                    cnt += cnts;
                    cnt %= n;
                }
            }
        } else {
            if (w[i] == 1) {
                long long len = (x[0] + l - x[i]) / 2;
                if (len < t) {
                    long long cnts = 1 + (2LL * (t - len) - 1) / l;
                    cnt += cnts;
                    cnt %= n;
                }
            }
        }
    }
    if (w[0] == 2) {
        cnt = (n - cnt) % n;
    }
    vector<long long> vv;
    for (int i = 0; i < n; i++) {
        if (w[i] == 1) {
            long long xx = x[i] + t;
            xx %= l;
            vv.push_back(xx);
        } else {
            long long xx = x[i] - t;
            xx %= l;
            if (xx < 0) {
                xx += l;
            }
            vv.push_back(xx);
        }
    }
    long long xx = vv[0];
    sort(all(vv));
    int p = upper_bound(all(vv), xx) - vv.begin() - 1;
    p -= cnt;
    if (p < 0) {
        p += n;
    }
    for (int i = 0; i < n; i++) {
        writeInt(vv[p] / 2, '\n');
        p++;
        if (p == n) {
            p = 0;
        }
    }
    return 0;
}


Measured memory_bytes: 3700