#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 1e5 + 10;

int L, t;


int get_dist(vi & ones, vi & zeros, int mone, int mzero, int mo, int mz) {
    int dist = zeros[(mzero + mz) % SZ(zeros)] + L * ((mzero + mz) / SZ(zeros));
    dist -= ones[(mone + mo) % SZ(ones)] - L * ((mone + mo) / SZ(ones));
    return dist;
}

void solve(vector<pii> pts, vi & ans) {

    vi ones, zeros;
    int n = SZ(pts);


    fori (i, n) {
        if (pts[i].second) {
            ones.push_back(pts[i].first);
        } else {
            zeros.push_back(pts[i].first);
        }
    }

    sort(RALL(ones));
    sort(ALL(zeros));

    if (min(SZ(ones), SZ(zeros)) == 0) {
        fori (i, n) {
            if (pts[i].second) {
                ans[i] = pts[i].first + t;
            }
        }
        return;
    }

    fori (i, n) {
        if (pts[i].second) {
            int mone = lower_bound(ALL(ones), pts[i].first, [&](int i, int j) -> bool {
                return i > j;
            }) - ones.begin();
            int mzero = lower_bound(ALL(zeros), pts[i].first) - zeros.begin();
            int l = -1, r = 2e9;
            while (r - l > 1) {
                int m = r + l >> 1;
                int dist = get_dist(ones, zeros, mone, mzero, m, m);
                if (dist <= t * 2) {
                    l = m;
                } else {
                    r = m;
                }
            }
            if (l == -1) {
                ans[i] = pts[i].first + t;
            } else {
                int dist = get_dist(ones, zeros, mone, mzero, l + 1, l);
                if (dist <= t * 2) {
                    ans[i] = ones[(mone + l + 1) % SZ(ones)] + t;
                } else {
                    ans[i] = zeros[(mzero + l) % SZ(zeros)] - t;
                }
            }
        }
    }

}

void smain() {

    int n;
    cin >> n >> L >> t;
    vector<pii> pts(n);
    fori (i, n) {
        cin >> pts[i].first >> pts[i].second;
        pts[i].second &= 1;
    }


    vi ans(n, -1);

//    t %= L;

    solve(pts, ans);

    reverse(ALL(pts));
    reverse(ALL(ans));
    for (auto & x : pts) {
        x.second ^= 1;
        x.first = L - x.first - 1;
    }

    solve(pts, ans);
    reverse(ALL(ans));
    reverse(ALL(pts));

    fori (i, n) {
        if (pts[i].second) {
            ans[i] = L - ans[i] - 1;
        }
        ans[i] = (L + ans[i] % L) % L;
        cout << ans[i] << ' ';
    }



}

Measured memory_bytes: 6424