// tzl ak IOI! 

#include<bits/stdc++.h>

#define HEAP priority_queue
#define rep(i, n) for(int i = 0, _end_ = (n); i < _end_; ++i)
#define per(i, n) for(int i = (n) - 1; i >= 0 ; --i)
#define forn(i, l, r) for(int i = (l), _end_ = (r); i <= _end_; ++i)
#define nrof(i, r, l) for(int i = (r), _end_ = (l); i >= _end_; --i)
#define FOR(a, b) for(auto (a): (b))
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-6
#define pi 3.1415926535897932384626433832795
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
#define FILL(a, b) memset((a), (b), sizeof((a)))
#define MCPY(a, b) memcpy((a), (b), sizeof((b)))

using namespace std;

typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int,int> pii;
typedef pair<int,LL> pil;
typedef pair<LL,int> pli;
typedef pair<LL,LL> pll;
typedef vector<pil> vil;
typedef vector<pii> vii;
typedef vector<pli> vli;
typedef vector<pll> vll;

const int iinf = 1e9 + 7;
const LL linf = 1ll << 60;
const flt dinf = 1e60;

template <typename T>
inline void scf(T &x)
{
	bool f = 0; x = 0; char c = getchar();
	while((c < '0' || c > '9') && c != '-') c = getchar();
	if(c == '-') { f = 1; c = getchar(); }
	while(c >= '0' && c <= '9') { x = x * 10 + c - '0'; c = getchar(); }
	if(f) x = -x; return;
}

template <typename T1, typename T2>
void scf(T1 &x, T2 &y) { scf(x); return scf(y); }

template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) { scf(x); scf(y); return scf(z); }

template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) { scf(x); scf(y); scf(z); return scf(w); }

inline char mygetchar(){ char c = getchar(); while(c == ' ' || c == '\n') c = getchar(); return c; }

template <typename T>
void chkmax(T &x, const T &y){ if(y > x) x = y; return; }

template <typename T>
void chkmin(T &x, const T &y){ if(y < x) x = y; return; }

#define ONLINE_JUDGE

#ifdef ONLINE_JUDGE
#define debug(x,c) ;
#else
#define DEBUG
#define debug(x,c) cerr<<#x<<"="<<x<<c;
#endif

void TZL();

void RANK1();

#define tzl int
#define ak main
#define IOI ()
tzl ak IOI
{
#undef tzl
#undef ak
#undef IOI

	TZL();
	RANK1();

#define tzl return
#define caisi 0
#define myy ;
	tzl caisi myy
#undef tzl
#undef caisi
#undef myy
}

//---------------------------head----------------------------

#define int long long

const int N = 1e5 + 100;

int n, l, T, shftsz;
int from[N], dir[N], to[N], ans[N];

void TZL()
{
	scf(n, l, T);
	forn(i, 1, n)
	{
		scf(from[i], dir[i]);
		if(dir[i] == 1)
		{
			to[i] = (from[i] + T) % l;
		}
		else
		{
			to[i] = (from[i] - T % l + l) % l;
		}
	}
	return;
}

deque<int> d1, d0;

int calc(int dst)
{
	dst = (dst % l + l) % l;
	int tbeg = dst;
	if(2 * T < tbeg) return 0;
	int ret = (2 * T - tbeg) / l;
	return ret + 1;
}

void SHIFT()
{
	static int foo[N], bar[N], buf[N];

	if(!dir[1])
		while(!dir[n - shftsz]) ++shftsz;
	else
	{
		shftsz = n;
		int i = 1;
		while(dir[i]) ++i, --shftsz;
	}

	forn(i, 1, n)
	{
		int j = (i + shftsz - 1) % n + 1;
		foo[j] = from[i];
		bar[j] = dir[i];
		buf[j] = to[i];
	}

	MCPY(from, foo); MCPY(dir, bar); MCPY(to, buf);
	nrof(i, n, 1) from[i] -= from[1];
	forn(i, 1, n) if(from[i] < 0) from[i] += l;
	return;
}

void BACK()
{
	if(shftsz) shftsz = (n - shftsz);
	static int foo[N];
	forn(i, 1, n)
	{
		int j = (i + shftsz - 1) % n + 1;
		foo[j] = ans[i];
	}
	MCPY(ans, foo);
	return;
}

void RANK1()
{
	int dlt = -1;
	forn(i, 1, n)
	{
		if(dir[i] == 1){ dlt = from[i]; break; }
	}

	if(!~dlt)
	{
		forn(i, 1, n) printf("%d\n", to[i]);
		return;
	}
	
	forn(i, 1, n)
	{
		dir[i]--;
	}

	int fst, lst;
	fst = lst = -1;

	forn(i, 1, n) if(dir[i])
	{
		if(!~fst) fst = i;
		lst = i;
	}

	if(!~lst)
	{
		forn(i, 1, n) printf("%d\n", to[i]);
		return;
	}

	SHIFT();

	forn(i, 1, n) if(dir[i]) d1.pb(from[i]); else d0.pb(from[i]);

	forn(i, 1, n) if(!dir[i])
	{
		while(d1.front() < from[i]) d1.pb(d1.front()), d1.pop_front();

		int foo = calc(d1[0] - from[i]);
		int lb = 0, rb = SZ(d1) - 1;
		while(lb <= rb)
		{
			int mid = lb + rb >> 1;
			if(calc(d1[mid] - from[i]) == foo) lb = mid + 1;
			else rb = mid - 1;
		}

		int jiao = foo * lb + (foo - 1) * (SZ(d1) - lb);
		int dest = (i - 1 + jiao) % n + 1;
		ans[dest] = to[i];
	}

	reverse(ALL(d0));

	nrof(i, n, 1) if(dir[i])
	{
		while(d0[0] > from[i]) d0.pb(d0[0]), d0.pop_front();

		int foo = calc(from[i] - d0[0]);
		int lb = 0, rb = SZ(d0) - 1;
		while(lb <= rb)
		{
			int mid = lb + rb >> 1;
			if(calc(from[i] - d0[mid]) == foo) lb = mid + 1;
			else rb = mid - 1;
		}

		int jiao = foo * lb + (foo - 1) * (SZ(d0) - lb);
		int dest = (i - 1 - jiao % n + n) % n + 1;
		ans[dest] = to[i];
	}

	BACK();
	forn(i, 1, n) printf("%d\n", ans[i]);
	return;
}

Measured memory_bytes: 8320