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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li pos[100100];
li pos2[100100];
li dir[100100];
li n, l, t;

inline li dist(li x, li y) {
    if (dir[x] == 1) {
        if (pos[x] > pos[y]) {
            return l - pos[x] + pos[y];
        } else {
            return pos[y] - pos[x];
        }
    } else {
        if (pos[x] > pos[y]) {
            return pos[x] - pos[y];
        } else {
            return pos[x] + l - pos[y];
        }
    }
}

int main() {
    cin >> n >> l >> t;
    vector<PI> state(n);
    rin{
        cin >> pos[i] >> dir[i];
        if (dir[i] == 2)dir[i] = -1;
    }
    li offset = 0;
    repp(i, 1, n) {
        if (dir[i] != dir[0]) {
            li d = dist(0, i);
            if (d >= t * 2)continue;
            offset++;
            offset += (t * 2 - d - 1) / l;
        }
    }
    if (dir[0] != 1) {
        offset %= n;
    } else {
        // 前の人にゼッケン渡すので、そのぶん相対的に後退する
        offset = -offset + n * 100100;
        offset %= n;
    }

    rin{
        pos2[i] = (pos[i] + t * dir[i] + l * 100100) % l;
    }
    li start_pos = pos2[0];
    //dump(pos, n);
    //dump(pos2, n);
    sort(pos2, pos2 + n);
    li offset2 = n;
    rin{
        if (pos2[i] == start_pos) {
            offset2 = i;
            if (dir[0] < 0 && i < n - 1 && pos2[i + 1] == pos2[i]) {
                offset2 = i + 1;
            }
            break;
        }
    }
    //p2(offset, offset2);
    if (offset2 == n)throw;
    rin{
        cout << pos2[(i + offset + offset2) % n] << endl;
    }



    return 0;
}

Measured memory_bytes: 5120