#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template <typename T>
inline T mod(T a, T m) {
    T res = a % m;
    if (res < 0) res += m;
    return res;
}


class Solver {
    int N, L, T;
    vi x, w;

    vi cw, ccw, xt;
    int CW, CCW;
public:
    Solver() {
        scanf("%d%d%d", &N, &L, &T);
        x.resize(N); w.resize(N);
        rep(i,N) {
            scanf("%d%d", &x[i], &w[i]);
        }

        init();

        if (N == 1) {
            printf("%d\n", xt[0]);
            return;
        }

        int dir0 = (w[0] == 1) ? 1 : -1;
        ll crossed = 0;
        if (dir0 == 1) {
            for (int y: ccw) {
                int d2 = y - x[0];
                if (d2 < 0) d2 += L;
                assert(IN(d2, 0, L-1));
                if (T*2 >= d2) {
                    int q = 1+(T*2 - d2)/L;
                    crossed += q;
                }
            }
        } else {
            for (int y: cw) {
                int d2 = x[0] - y;
                if (d2 < 0) d2 += L;
                assert(IN(d2, 0, L-1));
                if (T*2 >= d2) {
                    int q = 1+(T*2 - d2)/L;
                    crossed -= q;
                }
            }
        }

        int x0 = xt[0];
        int c0 = mod(0+crossed, (ll)N);

        sort(ALL(xt));

        int ix = lower_bound(ALL(xt), x0) - xt.begin();
        assert(xt[ix] == x0);

        int offset = 0;
        if (ix < N-1 && xt[ix+1] == x0) {
            if (dir0 == 1) {
                offset = ix+1 - c0;
            } else {
                offset = ix - c0;
            }
        } else {
            offset = ix - c0;
        }

        rep(i,N){
            printf("%d\n", xt[mod(i+offset, N)]);
        }
    }
private:
    void init() {
        cw.clear(); ccw.clear();
        cw.reserve(N); ccw.reserve(N);
        xt.resize(N);
        rep(i,N){
            if (w[i] == 1) {
                cw.pb(x[i]);
                xt[i] = mod(x[i] + T, L);
            } else {
                ccw.pb(x[i]);
                xt[i] = mod(x[i] - T, L);
            }
        }
        CW = cw.size(); CCW = ccw.size();
    }
};

int main() {
    Solver *s = new Solver();
    delete s;
    return 0;
}


Measured memory_bytes: 2816